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/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:26:37,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:26:37,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:26:37,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:26:37,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:26:37,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:26:37,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:26:37,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:26:37,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:26:37,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:26:37,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:26:37,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:26:37,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:26:37,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:26:37,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:26:37,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:26:37,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:26:37,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:26:37,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:26:37,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:26:37,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:26:37,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:26:37,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:26:37,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:26:37,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:26:37,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:26:37,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:26:37,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:26:37,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:26:37,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:26:37,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:26:37,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:26:37,067 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:26:37,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:26:37,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:26:37,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:26:37,069 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:26:37,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:26:37,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:26:37,083 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:26:37,083 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:26:37,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:26:37,084 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:26:37,084 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:26:37,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:26:37,084 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:26:37,085 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:26:37,085 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:26:37,085 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:26:37,085 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:26:37,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:26:37,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:26:37,086 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:26:37,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:26:37,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:26:37,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:26:37,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:26:37,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:26:37,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:26:37,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:26:37,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:26:37,089 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:26:37,089 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:26:37,089 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:26:37,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:26:37,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:26:37,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:26:37,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:26:37,090 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:26:37,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:26:37,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:26:37,092 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:26:37,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:26:37,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:26:37,093 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:26:37,093 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:26:37,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:26:37,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:26:37,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:26:37,177 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:26:37,178 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:26:37,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 17:26:37,179 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 17:26:37,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:26:37,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:26:37,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:37,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:26:37,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:26:37,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:37,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:26:37,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:26:37,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:26:37,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/1) ... [2018-12-03 17:26:37,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:26:37,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:26:37,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:26:37,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:26:37,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (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:26:37,393 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:26:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:26:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:26:37,661 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:26:37,661 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:26:37,663 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:37 BoogieIcfgContainer [2018-12-03 17:26:37,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:26:37,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:26:37,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:26:37,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:26:37,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:37" (1/2) ... [2018-12-03 17:26:37,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243d0c3a and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:26:37, skipping insertion in model container [2018-12-03 17:26:37,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:37" (2/2) ... [2018-12-03 17:26:37,673 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 17:26:37,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:26:37,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:26:37,714 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:26:37,755 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:26:37,755 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:26:37,755 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:26:37,755 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:26:37,756 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:26:37,756 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:26:37,756 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:26:37,756 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:26:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 17:26:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:26:37,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:37,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:37,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:37,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1807861163, now seen corresponding path program 1 times [2018-12-03 17:26:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:37,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:37,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:37,949 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:26:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:26:37,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:37,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:26:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:26:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:26:37,975 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 17:26:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:38,041 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 17:26:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:26:38,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 17:26:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:38,054 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:26:38,054 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:26:38,059 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:26:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:26:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:26:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:26:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 17:26:38,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 17:26:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:38,098 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 17:26:38,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:26:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 17:26:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:26:38,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:38,099 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:38,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:38,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 89245487, now seen corresponding path program 1 times [2018-12-03 17:26:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:38,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:38,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:38,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:38,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:38,227 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 17:26:38,229 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [17], [23], [25] [2018-12-03 17:26:38,311 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:38,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:38,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:26:38,798 INFO L272 AbstractInterpreter]: Visited 5 different actions 26 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:26:38,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:38,841 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:26:38,912 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 44.33% of their original sizes. [2018-12-03 17:26:38,912 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:26:39,024 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 17:26:39,024 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:26:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:26:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-03 17:26:39,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:26:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:26:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:26:39,028 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-03 17:26:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:39,456 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-12-03 17:26:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:26:39,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 17:26:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:39,457 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:26:39,458 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:26:39,459 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:26:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:26:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 17:26:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:26:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-03 17:26:39,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2018-12-03 17:26:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:39,468 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-03 17:26:39,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:26:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-12-03 17:26:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:26:39,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:39,469 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:39,470 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:39,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 89305069, now seen corresponding path program 1 times [2018-12-03 17:26:39,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:39,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:39,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:39,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:39,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:39,521 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 17:26:39,521 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [15], [17], [23], [25] [2018-12-03 17:26:39,522 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:39,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:39,884 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:26:39,885 INFO L272 AbstractInterpreter]: Visited 7 different actions 70 times. Merged at 5 different actions 49 times. Widened at 4 different actions 26 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:26:39,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:39,934 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:26:39,969 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 55.82% of their original sizes. [2018-12-03 17:26:39,969 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:26:40,096 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 17:26:40,096 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:26:40,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:26:40,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2018-12-03 17:26:40,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:40,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:26:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:26:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:26:40,098 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 7 states. [2018-12-03 17:26:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:40,627 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-03 17:26:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:26:40,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 17:26:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:40,628 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:26:40,629 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:26:40,629 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:26:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:26:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 17:26:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:26:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 17:26:40,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2018-12-03 17:26:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:40,637 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 17:26:40,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:26:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 17:26:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:26:40,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:40,639 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:40,639 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:40,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash -655877233, now seen corresponding path program 1 times [2018-12-03 17:26:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:40,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:40,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:40,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:40,718 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:26:40,718 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [15], [17], [21], [23], [25] [2018-12-03 17:26:40,720 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:40,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:41,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:26:41,033 INFO L272 AbstractInterpreter]: Visited 10 different actions 104 times. Merged at 8 different actions 62 times. Widened at 6 different actions 36 times. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:26:41,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:41,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:26:41,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,073 INFO 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:26:41,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:41,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:41,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:26:41,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:26:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:26:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:26:41,369 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2018-12-03 17:26:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:41,429 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-03 17:26:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:26:41,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 17:26:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:41,433 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:26:41,433 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:26:41,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:26:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:26:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:26:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:26:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 17:26:41,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 17:26:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:41,444 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 17:26:41,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:26:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 17:26:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:26:41,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:41,447 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:41,448 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:41,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1708107501, now seen corresponding path program 2 times [2018-12-03 17:26:41,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:41,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:41,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:41,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:41,662 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:41,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,663 INFO 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:26:41,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:41,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:41,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:26:41,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:41,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:26:41,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:41,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:26:41,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:26:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:26:41,824 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-12-03 17:26:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:41,856 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-03 17:26:41,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:26:41,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 17:26:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:41,858 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:26:41,858 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:26:41,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:26:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:26:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:26:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:26:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 17:26:41,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 17:26:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:41,867 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 17:26:41,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:26:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 17:26:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:26:41,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:41,869 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:41,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:41,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash 710886807, now seen corresponding path program 3 times [2018-12-03 17:26:41,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:41,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:41,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:41,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:41,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:41,972 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:41,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,973 INFO 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:26:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:41,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:42,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:42,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:42,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:42,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:42,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:26:42,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:42,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:26:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:26:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:42,161 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-12-03 17:26:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:42,296 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-03 17:26:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:26:42,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-03 17:26:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:42,298 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:26:42,298 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:26:42,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:26:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:26:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:26:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 17:26:42,309 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 17:26:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:42,309 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 17:26:42,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:26:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 17:26:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:26:42,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:42,310 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:42,311 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:42,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1787109659, now seen corresponding path program 4 times [2018-12-03 17:26:42,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:42,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:42,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:42,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:42,442 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:42,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:42,442 INFO 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:26:42,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:42,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:42,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:42,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:42,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:42,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:26:42,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:42,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:26:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:26:42,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:26:42,875 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2018-12-03 17:26:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:42,961 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-03 17:26:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:26:42,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 17:26:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:42,962 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:26:42,963 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:26:42,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:26:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:26:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:26:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:26:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 17:26:42,971 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 17:26:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:42,971 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 17:26:42,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:26:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 17:26:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:26:42,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:42,972 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:42,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:42,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 950152095, now seen corresponding path program 5 times [2018-12-03 17:26:42,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:43,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:43,089 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:43,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,090 INFO 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:26:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:43,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:43,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:26:43,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:43,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:43,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:26:43,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:43,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:26:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:26:43,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:26:43,312 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-12-03 17:26:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:43,380 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-03 17:26:43,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:26:43,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-03 17:26:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:43,385 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:26:43,385 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:26:43,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:26:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:26:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:26:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:26:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 17:26:43,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 17:26:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:43,398 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 17:26:43,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:26:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 17:26:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:26:43,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:43,399 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:43,400 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:43,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -207182557, now seen corresponding path program 6 times [2018-12-03 17:26:43,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:43,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:43,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:43,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:43,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:43,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:43,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:43,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:43,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:43,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:43,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:43,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:43,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:26:43,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:43,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:26:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:26:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:26:43,936 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2018-12-03 17:26:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:44,145 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 17:26:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:26:44,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-03 17:26:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:44,147 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:26:44,147 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:26:44,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:26:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:26:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:26:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:26:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 17:26:44,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 17:26:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:44,163 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 17:26:44,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:26:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 17:26:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:26:44,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:44,164 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:44,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:44,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash -9253465, now seen corresponding path program 7 times [2018-12-03 17:26:44,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:44,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:44,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:44,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:44,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:44,333 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:44,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:44,333 INFO 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:26:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:44,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:44,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:44,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:44,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:44,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:26:44,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:44,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:26:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:26:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:26:44,682 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2018-12-03 17:26:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:44,802 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-03 17:26:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:26:44,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-12-03 17:26:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:44,805 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:26:44,805 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:26:44,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:26:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:26:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:26:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:26:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 17:26:44,818 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-12-03 17:26:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:44,818 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 17:26:44,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:26:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 17:26:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:26:44,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:44,823 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:44,823 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:44,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1222042923, now seen corresponding path program 8 times [2018-12-03 17:26:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:44,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:45,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:45,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:45,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:45,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:26:45,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:45,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 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:26:45,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:45,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:45,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 17:26:45,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:45,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:45,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:45,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:45,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:26:45,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:45,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:26:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:26:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:26:45,601 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2018-12-03 17:26:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:45,646 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-03 17:26:45,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:26:45,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-12-03 17:26:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:45,652 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:26:45,652 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:26:45,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:26:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:26:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:26:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:26:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 17:26:45,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-12-03 17:26:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 17:26:45,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:26:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 17:26:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:26:45,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:45,662 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:45,663 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -913101905, now seen corresponding path program 9 times [2018-12-03 17:26:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:45,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:45,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:46,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:46,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:46,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:46,027 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:46,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:46,027 INFO 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:26:46,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:46,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:46,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:46,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:46,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:46,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:46,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:46,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:26:46,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:46,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:26:46,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:26:46,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:26:46,330 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 12 states. [2018-12-03 17:26:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:46,562 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-03 17:26:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:26:46,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 17:26:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:46,564 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:26:46,564 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:26:46,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:26:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:26:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:26:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:26:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 17:26:46,573 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-12-03 17:26:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:46,574 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 17:26:46,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:26:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 17:26:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:26:46,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:46,575 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:46,575 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:46,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 207085875, now seen corresponding path program 10 times [2018-12-03 17:26:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:46,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:46,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:46,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:46,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:46,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:46,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:46,796 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:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:46,797 INFO 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:26:46,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:46,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:46,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:46,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:47,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:47,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:26:47,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:26:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:26:47,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:26:47,100 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 13 states. [2018-12-03 17:26:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:47,191 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-03 17:26:47,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:26:47,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 17:26:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:47,192 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:26:47,192 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:26:47,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:26:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:26:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:26:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:26:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 17:26:47,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-12-03 17:26:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:47,200 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 17:26:47,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:26:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 17:26:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:26:47,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:47,201 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:47,201 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:47,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1329248841, now seen corresponding path program 11 times [2018-12-03 17:26:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:47,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:47,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:47,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:47,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:47,415 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:47,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:47,415 INFO 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:26:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:47,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:47,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:26:47,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:47,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:47,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:47,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:47,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:26:47,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:47,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:26:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:26:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:26:47,770 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-12-03 17:26:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:47,834 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-03 17:26:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:26:47,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-03 17:26:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:47,835 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:26:47,835 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:26:47,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:26:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:26:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:26:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:26:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 17:26:47,843 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-12-03 17:26:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:47,843 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 17:26:47,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:26:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 17:26:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:26:47,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:47,844 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:47,844 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:47,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash -278161093, now seen corresponding path program 12 times [2018-12-03 17:26:47,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:47,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:47,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:48,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:48,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:48,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:48,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:48,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:48,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:48,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:48,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:48,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:48,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:48,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:48,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:26:48,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:48,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:26:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:26:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:26:48,332 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-12-03 17:26:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:48,373 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-03 17:26:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:26:48,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-12-03 17:26:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:48,374 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:26:48,374 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:26:48,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 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:26:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:26:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:26:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:26:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 17:26:48,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-12-03 17:26:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 17:26:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:26:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 17:26:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:26:48,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:48,385 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:48,385 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:48,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash 499850175, now seen corresponding path program 13 times [2018-12-03 17:26:48,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:48,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:48,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:48,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:48,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:48,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:48,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:48,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:48,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:48,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:48,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:48,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:49,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:26:49,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:49,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:26:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:26:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:26:49,023 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 16 states. [2018-12-03 17:26:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:49,089 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 17:26:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:26:49,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-12-03 17:26:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:49,093 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:26:49,093 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:26:49,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:26:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:26:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:26:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:26:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 17:26:49,103 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-12-03 17:26:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:49,103 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 17:26:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:26:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 17:26:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:26:49,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:49,104 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:49,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:49,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 844369219, now seen corresponding path program 14 times [2018-12-03 17:26:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:49,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:49,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:49,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:49,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:49,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:49,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:49,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:49,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:49,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:49,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:49,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 17:26:49,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:49,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:49,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:50,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:50,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:26:50,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:50,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:26:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:26:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:26:50,050 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2018-12-03 17:26:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:50,110 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-03 17:26:50,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:26:50,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-12-03 17:26:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:50,111 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:26:50,111 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:26:50,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:26:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:26:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:26:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:26:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 17:26:50,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-12-03 17:26:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:50,120 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 17:26:50,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:26:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 17:26:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:26:50,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:50,121 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:50,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:50,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1214688711, now seen corresponding path program 15 times [2018-12-03 17:26:50,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:50,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:50,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:50,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:50,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:50,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:50,690 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:50,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:50,690 INFO 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:26:50,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:50,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:50,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:50,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:50,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:50,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:51,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:51,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:26:51,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:51,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:26:51,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:26:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:26:51,638 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 18 states. [2018-12-03 17:26:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:51,666 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-03 17:26:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:26:51,666 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-12-03 17:26:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:51,667 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:26:51,667 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:26:51,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:26:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:26:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:26:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:26:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-03 17:26:51,684 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-12-03 17:26:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:51,685 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-03 17:26:51,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:26:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-03 17:26:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:26:51,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:51,686 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:51,686 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:51,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash 609434955, now seen corresponding path program 16 times [2018-12-03 17:26:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:51,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:51,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:51,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:51,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:51,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:51,928 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:51,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:51,928 INFO 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:26:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:51,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:51,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:51,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:52,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:52,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:26:52,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:52,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:26:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:26:52,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:26:52,799 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2018-12-03 17:26:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:52,862 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-03 17:26:52,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:26:52,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-12-03 17:26:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:52,863 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:26:52,863 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:26:52,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:26:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:26:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:26:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:26:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 17:26:52,872 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-12-03 17:26:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:52,872 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 17:26:52,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:26:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 17:26:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:26:52,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:52,873 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:52,874 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:52,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1218839601, now seen corresponding path program 17 times [2018-12-03 17:26:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:52,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:52,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:53,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:53,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:53,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:53,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:26:53,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:53,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 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:26:53,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:53,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:53,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:26:53,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:53,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:53,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:54,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:26:54,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:54,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:26:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:26:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:26:54,030 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 20 states. [2018-12-03 17:26:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:54,071 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-03 17:26:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:26:54,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-12-03 17:26:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:54,072 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:26:54,072 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:26:54,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 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:26:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:26:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:26:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:26:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 17:26:54,080 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-12-03 17:26:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:54,080 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 17:26:54,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:26:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 17:26:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:26:54,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:54,081 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:54,081 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:54,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1549063853, now seen corresponding path program 18 times [2018-12-03 17:26:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:54,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:54,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:54,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:54,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:54,433 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:54,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:54,433 INFO 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:26:54,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:54,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:54,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:54,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:54,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:54,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:55,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:26:55,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:55,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:26:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:26:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:26:55,032 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 21 states. [2018-12-03 17:26:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:55,097 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-03 17:26:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:26:55,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-03 17:26:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:55,098 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:26:55,098 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:26:55,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:26:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:26:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:26:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:26:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 17:26:55,108 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-12-03 17:26:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:55,108 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 17:26:55,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:26:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 17:26:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:26:55,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:55,109 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:55,109 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:55,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1066990121, now seen corresponding path program 19 times [2018-12-03 17:26:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:55,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:55,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:55,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:55,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:55,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:55,562 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:55,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:55,563 INFO 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:26:55,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:55,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:55,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:55,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:56,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:56,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:26:56,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:56,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:26:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:26:56,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:26:56,161 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 22 states. [2018-12-03 17:26:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:56,390 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-03 17:26:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:26:56,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 17:26:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:56,393 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:26:56,393 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:26:56,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:26:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:26:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:26:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:26:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 17:26:56,404 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-12-03 17:26:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:56,404 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 17:26:56,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:26:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 17:26:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:26:56,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:56,405 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:56,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:56,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1650601637, now seen corresponding path program 20 times [2018-12-03 17:26:56,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:56,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:56,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:57,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:57,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:57,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:57,188 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:57,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:57,189 INFO 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:26:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:57,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:57,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 17:26:57,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:57,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:57,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:26:58,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:58,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:26:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:26:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:26:58,042 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 23 states. [2018-12-03 17:26:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:58,116 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 17:26:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:26:58,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-12-03 17:26:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:58,117 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:26:58,118 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:26:58,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:26:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:26:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:26:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:26:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 17:26:58,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-12-03 17:26:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:58,129 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 17:26:58,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:26:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 17:26:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:26:58,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:58,130 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:58,130 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:58,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash 139447263, now seen corresponding path program 21 times [2018-12-03 17:26:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:58,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:58,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:58,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:58,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:58,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:58,405 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:58,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:58,405 INFO 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:26:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:58,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:58,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:58,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:58,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:58,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:26:59,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:59,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:26:59,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:26:59,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:26:59,012 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 24 states. [2018-12-03 17:26:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:59,071 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-03 17:26:59,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:26:59,073 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-12-03 17:26:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:59,073 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:26:59,073 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:26:59,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:26:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:26:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:26:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:26:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 17:26:59,083 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-12-03 17:26:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:59,083 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 17:26:59,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:26:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 17:26:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:26:59,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:59,084 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:26:59,084 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:59,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1905445533, now seen corresponding path program 22 times [2018-12-03 17:26:59,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:59,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:59,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:59,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:59,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:59,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:59,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:59,794 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:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:59,794 INFO 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:26:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:59,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:59,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:26:59,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:27:00,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:00,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:27:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:27:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:27:00,744 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 25 states. [2018-12-03 17:27:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:00,811 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 17:27:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:27:00,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-12-03 17:27:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:00,812 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:27:00,812 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:27:00,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:27:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:27:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:27:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:27:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 17:27:00,822 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-12-03 17:27:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:00,822 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 17:27:00,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:27:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 17:27:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:27:00,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:00,823 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:00,823 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:00,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash 47599079, now seen corresponding path program 23 times [2018-12-03 17:27:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:00,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:01,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:01,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:01,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:01,607 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:01,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:01,607 INFO 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:27:01,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:01,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:01,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:27:01,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:01,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:01,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:27:02,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:02,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:27:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:27:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:27:02,382 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 26 states. [2018-12-03 17:27:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:02,492 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-03 17:27:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:27:02,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-12-03 17:27:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:02,494 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:27:02,494 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:27:02,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:27:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:27:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:27:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:27:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 17:27:02,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-12-03 17:27:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:02,505 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 17:27:02,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:27:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 17:27:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:27:02,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:02,506 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:02,506 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:02,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 22762859, now seen corresponding path program 24 times [2018-12-03 17:27:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:03,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:03,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:03,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:27:03,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,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 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:27:03,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:03,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:03,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:03,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:03,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:03,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:03,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:27:03,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:27:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:27:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:27:03,870 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 27 states. [2018-12-03 17:27:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:03,917 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-03 17:27:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:27:03,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-12-03 17:27:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:03,922 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:27:03,922 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:27:03,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:27:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:27:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:27:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:27:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 17:27:03,931 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-12-03 17:27:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:03,931 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 17:27:03,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:27:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 17:27:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:27:03,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:03,932 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:03,932 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1924959215, now seen corresponding path program 25 times [2018-12-03 17:27:03,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:03,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:03,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:04,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:04,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:04,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:04,348 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:04,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:04,348 INFO 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:27:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:04,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:04,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:04,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:05,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:27:05,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:05,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:27:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:27:05,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:27:05,791 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 28 states. [2018-12-03 17:27:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:05,904 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-03 17:27:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:27:05,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-12-03 17:27:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:05,906 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:27:05,906 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:27:05,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:27:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:27:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:27:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:27:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 17:27:05,913 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-12-03 17:27:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:05,914 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 17:27:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:27:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 17:27:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:27:05,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:05,914 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:05,915 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:05,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash 279589235, now seen corresponding path program 26 times [2018-12-03 17:27:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:05,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:05,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:06,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:06,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:06,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:06,322 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:06,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:06,322 INFO 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:27:06,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:06,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:06,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 17:27:06,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:06,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:06,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:07,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:27:07,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:07,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:27:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:27:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:27:07,286 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 29 states. [2018-12-03 17:27:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:07,386 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-03 17:27:07,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:27:07,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-12-03 17:27:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:07,387 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:27:07,387 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:27:07,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:27:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:27:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:27:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:27:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 17:27:07,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-12-03 17:27:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:07,399 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 17:27:07,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:27:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 17:27:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:27:07,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:07,399 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:07,400 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:07,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash -372996617, now seen corresponding path program 27 times [2018-12-03 17:27:07,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:07,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:07,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:07,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:07,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:07,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:07,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:07,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:07,999 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,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:07,999 INFO 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:27:08,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:08,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:08,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:08,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:08,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:08,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:08,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:08,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:27:08,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:27:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:27:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:27:08,979 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 30 states. [2018-12-03 17:27:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:09,034 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-03 17:27:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:27:09,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-12-03 17:27:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:09,036 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:27:09,036 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:27:09,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:27:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:27:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:27:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:27:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 17:27:09,046 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-12-03 17:27:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 17:27:09,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:27:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 17:27:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:27:09,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:09,047 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:09,048 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:09,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -442775173, now seen corresponding path program 28 times [2018-12-03 17:27:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:09,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:09,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:10,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:10,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:10,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:10,181 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:10,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:10,181 INFO 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:27:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:10,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:10,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:10,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:11,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:27:11,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:11,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:27:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:27:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:27:11,536 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 31 states. [2018-12-03 17:27:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:11,634 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-03 17:27:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:27:11,634 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-12-03 17:27:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:11,635 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:27:11,635 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:27:11,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:27:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:27:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:27:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:27:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 17:27:11,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-12-03 17:27:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:11,646 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 17:27:11,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:27:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 17:27:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:27:11,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:11,647 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:11,647 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:11,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1219509247, now seen corresponding path program 29 times [2018-12-03 17:27:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:11,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:11,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:12,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:12,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:12,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:12,080 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:12,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:12,080 INFO 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:27:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:12,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:12,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:27:12,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:12,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:12,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:27:13,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:13,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:27:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:27:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:27:13,256 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 32 states. [2018-12-03 17:27:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:13,300 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 17:27:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:27:13,301 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-12-03 17:27:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:13,302 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:27:13,303 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:27:13,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 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:27:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:27:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:27:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:27:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 17:27:13,317 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-12-03 17:27:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:13,318 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 17:27:13,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:27:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 17:27:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:27:13,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:13,319 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:13,319 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:13,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash 947002755, now seen corresponding path program 30 times [2018-12-03 17:27:13,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:13,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:13,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:13,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:13,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:13,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:13,973 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:13,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:13,973 INFO 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:27:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:13,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:14,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:14,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:14,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:14,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:15,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:15,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:27:15,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:15,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:27:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:27:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:27:15,128 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 33 states. [2018-12-03 17:27:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:15,216 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-03 17:27:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:27:15,216 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-12-03 17:27:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:15,217 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:27:15,217 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:27:15,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:27:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:27:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:27:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:27:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 17:27:15,226 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-12-03 17:27:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:15,226 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 17:27:15,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:27:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 17:27:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:27:15,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:15,227 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:15,227 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:15,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1061268999, now seen corresponding path program 31 times [2018-12-03 17:27:15,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:15,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:15,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:15,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:15,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:15,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:15,923 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:15,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:15,923 INFO 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:27:15,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:15,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:15,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:15,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:17,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:17,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:27:17,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:17,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:27:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:27:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:27:17,277 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 34 states. [2018-12-03 17:27:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:17,339 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 17:27:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:27:17,339 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-12-03 17:27:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:17,340 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:27:17,340 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:27:17,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:27:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:27:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:27:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:27:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 17:27:17,351 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-12-03 17:27:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:17,351 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 17:27:17,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:27:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 17:27:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:27:17,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:17,352 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:17,352 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:17,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash -798020213, now seen corresponding path program 32 times [2018-12-03 17:27:17,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:17,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:17,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:18,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:18,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:18,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:18,102 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:18,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:18,102 INFO 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:27:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:18,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:18,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 17:27:18,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:18,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:18,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:27:19,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:19,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:27:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:27:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:27:19,425 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 35 states. [2018-12-03 17:27:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:19,525 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-03 17:27:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:27:19,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-12-03 17:27:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:19,527 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:27:19,527 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:27:19,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:27:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:27:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:27:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:27:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 17:27:19,539 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-12-03 17:27:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:19,540 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 17:27:19,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:27:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 17:27:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:27:19,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:19,541 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:19,541 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:19,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash -868557809, now seen corresponding path program 33 times [2018-12-03 17:27:19,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:19,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:19,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:19,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:19,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:20,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:20,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:20,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:20,141 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:20,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:20,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:20,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:20,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:20,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:20,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:20,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:21,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:21,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:27:21,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:21,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:27:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:27:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:27:21,974 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 36 states. [2018-12-03 17:27:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:22,141 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-03 17:27:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:27:22,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-12-03 17:27:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:22,142 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:27:22,142 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:27:22,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:27:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:27:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:27:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:27:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-03 17:27:22,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-12-03 17:27:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-03 17:27:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:27:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-03 17:27:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:27:22,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:22,153 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:22,153 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 64289171, now seen corresponding path program 34 times [2018-12-03 17:27:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:22,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:22,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:22,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:22,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:22,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:22,736 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:22,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:22,737 INFO 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:27:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:22,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:22,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:22,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:24,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:24,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:27:24,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:24,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:27:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:27:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:27:24,224 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 37 states. [2018-12-03 17:27:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:24,340 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-03 17:27:24,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:27:24,341 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-12-03 17:27:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:24,341 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:27:24,341 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:27:24,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 126 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:27:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:27:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:27:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:27:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 17:27:24,352 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-12-03 17:27:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:24,352 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 17:27:24,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:27:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 17:27:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:27:24,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:24,353 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:24,353 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:24,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1117927913, now seen corresponding path program 35 times [2018-12-03 17:27:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:24,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:24,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:24,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:24,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:24,946 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:24,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:24,946 INFO 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:27:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:24,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:25,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:27:25,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:25,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:25,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:26,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:27:26,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:26,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:27:26,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:27:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:27:26,852 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2018-12-03 17:27:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:26,942 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-03 17:27:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:27:26,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-12-03 17:27:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:26,943 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:27:26,943 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:27:26,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:27:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:27:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:27:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:27:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 17:27:26,954 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-12-03 17:27:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:26,955 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 17:27:26,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:27:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 17:27:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:27:26,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:26,955 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:26,956 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 937787803, now seen corresponding path program 36 times [2018-12-03 17:27:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:26,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:26,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:27,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:27,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:27,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:27,672 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:27,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:27,672 INFO 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:27:27,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:27,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:27,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:27,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:27,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:27,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:27:30,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:30,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:27:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:27:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:27:30,032 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 39 states. [2018-12-03 17:27:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:30,106 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-03 17:27:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:27:30,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2018-12-03 17:27:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:30,107 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:27:30,107 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:27:30,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:27:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:27:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:27:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:27:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 17:27:30,121 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-12-03 17:27:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:30,121 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 17:27:30,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:27:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 17:27:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:27:30,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:30,122 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:30,122 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:30,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 795634719, now seen corresponding path program 37 times [2018-12-03 17:27:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:30,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:30,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:30,781 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:30,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,781 INFO 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:27:30,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:30,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:30,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:32,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:27:32,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:32,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:27:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:27:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:27:32,776 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 40 states. [2018-12-03 17:27:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:32,853 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-03 17:27:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:27:32,853 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 87 [2018-12-03 17:27:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:32,854 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:27:32,854 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:27:32,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 135 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:27:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:27:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:27:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:27:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 17:27:32,869 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-12-03 17:27:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:32,869 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 17:27:32,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:27:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 17:27:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:27:32,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:32,870 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:32,870 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:32,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1625474467, now seen corresponding path program 38 times [2018-12-03 17:27:32,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:32,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:33,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:33,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:33,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:33,725 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:33,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:33,726 INFO 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:27:33,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:33,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:33,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 17:27:33,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:33,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:33,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:27:35,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:35,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:27:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:27:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:27:35,676 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 41 states. [2018-12-03 17:27:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:35,786 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-03 17:27:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:27:35,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2018-12-03 17:27:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:35,787 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:27:35,787 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:27:35,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:27:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:27:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:27:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:27:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 17:27:35,798 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-12-03 17:27:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:35,798 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 17:27:35,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:27:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 17:27:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:27:35,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:35,799 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:35,799 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:35,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 237555239, now seen corresponding path program 39 times [2018-12-03 17:27:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:35,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:35,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:37,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:37,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:37,220 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:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:37,220 INFO 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:27:37,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:37,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:37,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:37,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:37,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:37,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:39,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:39,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:27:39,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:39,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:27:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:27:39,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:27:39,091 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 42 states. [2018-12-03 17:27:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:39,356 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-03 17:27:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:27:39,357 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 91 [2018-12-03 17:27:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:39,358 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:27:39,358 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:27:39,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:27:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:27:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:27:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:27:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-03 17:27:39,369 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-12-03 17:27:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:39,369 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-03 17:27:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:27:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-03 17:27:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:27:39,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:39,370 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:39,370 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:39,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2112961109, now seen corresponding path program 40 times [2018-12-03 17:27:39,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:39,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:39,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:40,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:40,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:40,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:40,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:40,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:40,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:40,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:40,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:40,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:42,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:42,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:27:42,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:42,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:27:42,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:27:42,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:27:42,348 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 43 states. [2018-12-03 17:27:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:42,460 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-03 17:27:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:27:42,460 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 93 [2018-12-03 17:27:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:42,461 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:27:42,461 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:27:42,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:27:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:27:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:27:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:27:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 17:27:42,472 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-12-03 17:27:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:42,473 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 17:27:42,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:27:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 17:27:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:27:42,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:42,473 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:42,473 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1806373841, now seen corresponding path program 41 times [2018-12-03 17:27:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:43,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:43,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:43,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:43,443 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:43,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:43,444 INFO 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:27:43,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:43,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:43,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 17:27:43,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:43,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:43,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:46,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:46,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:27:46,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:46,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:27:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:27:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:27:46,007 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 44 states. [2018-12-03 17:27:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:46,122 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-03 17:27:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:27:46,122 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2018-12-03 17:27:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:46,124 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:27:46,124 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:27:46,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:27:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:27:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:27:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:27:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 17:27:46,137 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-12-03 17:27:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:46,137 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 17:27:46,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:27:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 17:27:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:27:46,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:46,138 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:46,138 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 766214579, now seen corresponding path program 42 times [2018-12-03 17:27:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:46,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:46,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:47,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:47,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:47,588 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:47,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,588 INFO 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:27:47,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:47,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:47,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:47,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:47,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:47,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:49,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:49,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:27:49,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:49,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:27:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:27:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:27:49,940 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 45 states. [2018-12-03 17:27:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:50,289 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-03 17:27:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:27:50,296 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 97 [2018-12-03 17:27:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:50,297 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:27:50,297 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:27:50,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:27:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:27:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:27:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:27:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 17:27:50,311 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-12-03 17:27:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:50,312 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 17:27:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:27:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 17:27:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:27:50,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:50,313 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:50,313 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:50,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -877476297, now seen corresponding path program 43 times [2018-12-03 17:27:50,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:50,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:50,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:51,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:51,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:27:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,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 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:27:51,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:51,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:51,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:51,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:27:53,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:27:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:27:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:27:53,885 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 46 states. [2018-12-03 17:27:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:54,009 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-03 17:27:54,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:27:54,016 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 99 [2018-12-03 17:27:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:54,017 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:27:54,017 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:27:54,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:27:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:27:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:27:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:27:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 17:27:54,032 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-12-03 17:27:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:54,032 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 17:27:54,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:27:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 17:27:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:27:54,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:54,033 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:54,033 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:54,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 83556795, now seen corresponding path program 44 times [2018-12-03 17:27:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:55,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:55,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:55,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:55,091 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:55,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:55,091 INFO 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:27:55,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:55,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:55,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 17:27:55,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:55,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:55,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:58,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:27:58,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:58,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:27:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:27:58,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:27:58,129 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 47 states. [2018-12-03 17:27:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:58,285 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-12-03 17:27:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:27:58,286 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 101 [2018-12-03 17:27:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:58,287 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:27:58,287 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:27:58,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:27:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:27:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:27:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:27:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 17:27:58,301 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-12-03 17:27:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 17:27:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:27:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 17:27:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:27:58,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:58,302 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:27:58,302 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:58,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 218389567, now seen corresponding path program 45 times [2018-12-03 17:27:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:58,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:58,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:59,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:59,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:59,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:59,356 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:59,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:59,357 INFO 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:27:59,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:59,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:59,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:59,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:59,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:27:59,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:01,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:01,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:28:01,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:01,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:28:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:28:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:28:01,872 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 48 states. [2018-12-03 17:28:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:02,020 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-03 17:28:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:28:02,020 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2018-12-03 17:28:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:02,021 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:28:02,021 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:28:02,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:28:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:28:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:28:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:28:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 17:28:02,036 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-12-03 17:28:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:02,037 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 17:28:02,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:28:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 17:28:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:28:02,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:02,038 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:02,038 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:02,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 943664579, now seen corresponding path program 46 times [2018-12-03 17:28:02,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:02,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:03,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:03,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:03,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:03,155 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:28:03,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:03,155 INFO 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:28:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:03,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:03,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:03,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:05,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:28:05,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:05,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:28:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:28:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:28:05,682 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 49 states. [2018-12-03 17:28:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:05,787 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-03 17:28:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:28:05,787 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 105 [2018-12-03 17:28:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:05,788 INFO L225 Difference]: With dead ends: 119 [2018-12-03 17:28:05,788 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:28:05,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:28:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:28:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:28:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:28:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 17:28:05,801 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-12-03 17:28:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:05,801 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 17:28:05,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:28:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 17:28:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:28:05,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:05,802 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:05,802 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2146718137, now seen corresponding path program 47 times [2018-12-03 17:28:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:06,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:06,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:06,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:06,846 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:28:06,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:06,847 INFO 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:28:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:06,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:06,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 17:28:06,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:06,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:06,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:09,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:09,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:28:09,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:28:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:28:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:28:09,755 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2018-12-03 17:28:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:10,096 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-12-03 17:28:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:28:10,097 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2018-12-03 17:28:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:10,098 INFO L225 Difference]: With dead ends: 121 [2018-12-03 17:28:10,098 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:28:10,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:28:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:28:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:28:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:28:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 17:28:10,115 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-12-03 17:28:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:10,116 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 17:28:10,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:28:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 17:28:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:28:10,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:10,117 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:10,117 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:10,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 112860619, now seen corresponding path program 48 times [2018-12-03 17:28:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:11,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:11,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:11,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:11,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,507 INFO 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:28:11,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:11,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:11,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:11,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:11,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:11,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:14,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:14,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:28:14,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:14,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:28:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:28:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:28:14,525 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 51 states. [2018-12-03 17:28:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:14,600 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-12-03 17:28:14,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:28:14,601 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 109 [2018-12-03 17:28:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:14,602 INFO L225 Difference]: With dead ends: 123 [2018-12-03 17:28:14,603 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:28:14,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:28:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:28:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:28:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:28:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 17:28:14,615 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-12-03 17:28:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:14,615 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 17:28:14,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:28:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 17:28:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:28:14,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:14,616 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:14,617 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:14,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1685406641, now seen corresponding path program 49 times [2018-12-03 17:28:14,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:14,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:14,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:15,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:15,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:15,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:15,690 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:28:15,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:15,690 INFO 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:28:15,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:15,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:15,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:15,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:19,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:19,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:28:19,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:19,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:28:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:28:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:28:19,190 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 52 states. [2018-12-03 17:28:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:19,331 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-03 17:28:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:28:19,331 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 111 [2018-12-03 17:28:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:19,333 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:28:19,333 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:28:19,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:28:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:28:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:28:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:28:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 17:28:19,346 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-12-03 17:28:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:19,347 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 17:28:19,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:28:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 17:28:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:28:19,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:19,347 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:19,347 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:19,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1051576787, now seen corresponding path program 50 times [2018-12-03 17:28:19,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:19,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:19,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:19,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:20,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:20,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:20,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:20,512 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:28:20,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:20,512 INFO 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:28:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:20,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:20,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 17:28:20,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:20,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:20,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:28:23,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:23,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:28:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:28:23,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:28:23,807 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 53 states. [2018-12-03 17:28:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:23,958 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-03 17:28:23,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:28:23,959 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 113 [2018-12-03 17:28:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:23,960 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:28:23,960 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:28:23,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:28:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:28:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:28:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:28:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 17:28:23,973 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-12-03 17:28:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 17:28:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:28:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 17:28:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:28:23,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:23,975 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:23,975 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:23,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1522301353, now seen corresponding path program 51 times [2018-12-03 17:28:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:25,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:25,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:25,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:25,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:25,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:25,150 INFO 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:28:25,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:25,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:25,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:25,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:25,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:28,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:28,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:28:28,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:28,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:28:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:28:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:28:28,701 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 54 states. [2018-12-03 17:28:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:28,808 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-12-03 17:28:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:28:28,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 115 [2018-12-03 17:28:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:28,810 INFO L225 Difference]: With dead ends: 129 [2018-12-03 17:28:28,810 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 17:28:28,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:28:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 17:28:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 17:28:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:28:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-12-03 17:28:28,824 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-12-03 17:28:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:28,824 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-12-03 17:28:28,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:28:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-12-03 17:28:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 17:28:28,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:28,825 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:28,825 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:28,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1118031397, now seen corresponding path program 52 times [2018-12-03 17:28:28,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:28,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:28,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:28,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:30,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:30,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:30,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:30,003 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:28:30,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:30,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 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:28:30,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:30,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:30,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:30,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:33,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:28:33,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:33,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:28:33,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:28:33,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:28:33,489 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 55 states. [2018-12-03 17:28:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:33,568 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-03 17:28:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:28:33,568 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2018-12-03 17:28:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:33,569 INFO L225 Difference]: With dead ends: 131 [2018-12-03 17:28:33,570 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 17:28:33,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:28:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 17:28:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 17:28:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:28:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 17:28:33,587 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-12-03 17:28:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:33,587 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 17:28:33,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:28:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 17:28:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 17:28:33,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:33,588 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:33,589 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:33,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash 838339679, now seen corresponding path program 53 times [2018-12-03 17:28:33,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:34,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:34,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:34,768 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:28:34,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,768 INFO 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:28:34,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:34,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:34,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 17:28:34,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:34,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:34,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:38,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:28:38,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:38,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:28:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:28:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:28:38,361 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 56 states. [2018-12-03 17:28:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:38,471 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-12-03 17:28:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:28:38,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 119 [2018-12-03 17:28:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:38,472 INFO L225 Difference]: With dead ends: 133 [2018-12-03 17:28:38,472 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:28:38,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:28:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:28:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 17:28:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:28:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 17:28:38,485 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-12-03 17:28:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:38,486 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 17:28:38,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:28:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 17:28:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:28:38,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:38,487 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:38,487 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash -284731933, now seen corresponding path program 54 times [2018-12-03 17:28:38,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:38,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:38,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:39,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:39,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:39,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:39,714 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:28:39,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:39,715 INFO 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:28:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:39,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:39,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:39,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:39,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:39,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:43,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:43,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:28:43,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:43,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:28:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:28:43,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:28:43,409 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 57 states. [2018-12-03 17:28:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:43,569 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-03 17:28:43,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:28:43,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 121 [2018-12-03 17:28:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:43,570 INFO L225 Difference]: With dead ends: 135 [2018-12-03 17:28:43,570 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 17:28:43,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:28:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 17:28:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 17:28:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:28:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 17:28:43,588 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-12-03 17:28:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:43,588 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 17:28:43,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:28:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 17:28:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:28:43,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:43,589 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:43,589 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:43,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1519759769, now seen corresponding path program 55 times [2018-12-03 17:28:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:43,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:44,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:44,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:44,778 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:28:44,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:44,778 INFO 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:28:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:44,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:44,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:44,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:48,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:48,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:28:48,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:48,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:28:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:28:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:28:48,512 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 58 states. [2018-12-03 17:28:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:48,598 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-03 17:28:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:28:48,599 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 123 [2018-12-03 17:28:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:48,600 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:28:48,600 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 17:28:48,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:28:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 17:28:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 17:28:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 17:28:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 17:28:48,615 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-12-03 17:28:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:48,615 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 17:28:48,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:28:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 17:28:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 17:28:48,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:48,616 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:48,616 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:48,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1324430827, now seen corresponding path program 56 times [2018-12-03 17:28:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:48,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:49,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:49,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:49,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:49,813 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:28:49,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:49,813 INFO 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:28:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:49,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:49,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 17:28:49,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:49,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:49,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:53,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:28:53,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:53,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:28:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:28:53,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:28:53,637 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 59 states. [2018-12-03 17:28:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:53,791 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-03 17:28:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:28:53,792 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 125 [2018-12-03 17:28:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:53,792 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:28:53,792 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 17:28:53,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:28:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 17:28:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 17:28:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:28:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 17:28:53,805 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-12-03 17:28:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:53,805 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 17:28:53,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:28:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 17:28:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 17:28:53,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:53,806 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:53,806 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:53,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1302573969, now seen corresponding path program 57 times [2018-12-03 17:28:53,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:53,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:53,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:55,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:55,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:55,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:55,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:55,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:55,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:55,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:55,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:55,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:55,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:55,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:55,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:28:59,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:59,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:28:59,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:59,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:28:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:28:59,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:28:59,190 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 60 states. [2018-12-03 17:28:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:59,355 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-12-03 17:28:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:28:59,356 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 127 [2018-12-03 17:28:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:59,357 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:28:59,357 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 17:28:59,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:28:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 17:28:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 17:28:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:28:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 17:28:59,370 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-12-03 17:28:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:59,370 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 17:28:59,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:28:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 17:28:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 17:28:59,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:59,371 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:28:59,371 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:59,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -413412877, now seen corresponding path program 58 times [2018-12-03 17:28:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:59,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:59,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:00,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:00,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:00,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:00,787 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:29:00,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:00,787 INFO 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:29:00,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:00,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:00,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:00,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:29:05,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:05,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:29:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:29:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:29:05,111 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 61 states. [2018-12-03 17:29:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:05,288 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 17:29:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:29:05,288 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 129 [2018-12-03 17:29:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:05,289 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:29:05,289 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 17:29:05,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:29:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 17:29:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 17:29:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:29:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 17:29:05,302 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-12-03 17:29:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:05,302 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 17:29:05,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:29:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 17:29:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 17:29:05,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:05,303 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:05,303 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -628095369, now seen corresponding path program 59 times [2018-12-03 17:29:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:06,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:06,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:06,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:29:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,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 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:29:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:06,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:06,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 17:29:06,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:06,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:06,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:10,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:10,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:29:10,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:10,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:29:10,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:29:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:29:10,962 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 62 states. [2018-12-03 17:29:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:11,142 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-12-03 17:29:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:29:11,142 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 131 [2018-12-03 17:29:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:11,144 INFO L225 Difference]: With dead ends: 145 [2018-12-03 17:29:11,144 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 17:29:11,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:29:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 17:29:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 17:29:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:29:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 17:29:11,158 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-12-03 17:29:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 17:29:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:29:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 17:29:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 17:29:11,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:11,159 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:11,160 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:11,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -779539973, now seen corresponding path program 60 times [2018-12-03 17:29:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:11,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:12,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:12,617 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:12,617 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:29:12,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,617 INFO 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:29:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:12,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:12,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:12,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:12,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:12,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:17,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:29:17,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:17,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:29:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:29:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:29:17,387 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 63 states. [2018-12-03 17:29:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:17,509 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-12-03 17:29:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:29:17,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 133 [2018-12-03 17:29:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:17,511 INFO L225 Difference]: With dead ends: 147 [2018-12-03 17:29:17,511 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 17:29:17,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:29:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 17:29:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 17:29:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:29:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 17:29:17,525 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-12-03 17:29:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:17,526 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 17:29:17,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:29:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 17:29:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:29:17,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:17,526 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:17,527 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -288916353, now seen corresponding path program 61 times [2018-12-03 17:29:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:17,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:17,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:19,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:19,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:19,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:19,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:29:19,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:19,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 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:29:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:19,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:19,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:19,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:23,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:23,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:29:23,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:23,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:29:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:29:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:29:23,510 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 64 states. [2018-12-03 17:29:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:23,690 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-03 17:29:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:29:23,691 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 135 [2018-12-03 17:29:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:23,692 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:29:23,692 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:29:23,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:29:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:29:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 17:29:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 17:29:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 17:29:23,707 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-12-03 17:29:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:23,707 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 17:29:23,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:29:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 17:29:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 17:29:23,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:23,708 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:23,708 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:23,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1246020093, now seen corresponding path program 62 times [2018-12-03 17:29:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:23,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:25,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:25,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:25,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:25,545 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:29:25,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:25,545 INFO 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:29:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:25,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:25,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 17:29:25,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:25,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:25,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:30,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:30,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:29:30,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:30,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:29:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:29:30,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:29:30,362 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 65 states. [2018-12-03 17:29:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:30,569 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-12-03 17:29:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:29:30,570 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 137 [2018-12-03 17:29:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:30,571 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:29:30,571 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 17:29:30,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:29:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 17:29:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 17:29:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 17:29:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 17:29:30,589 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-12-03 17:29:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:30,589 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 17:29:30,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:29:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 17:29:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 17:29:30,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:30,590 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:30,590 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:30,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1899712889, now seen corresponding path program 63 times [2018-12-03 17:29:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:30,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:30,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:30,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:30,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:32,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:32,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:32,382 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:29:32,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,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 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:29:32,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:32,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:32,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:32,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:32,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:32,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:37,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:37,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:29:37,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:37,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:29:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:29:37,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:29:37,175 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 66 states. [2018-12-03 17:29:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:37,350 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-12-03 17:29:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:29:37,351 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 139 [2018-12-03 17:29:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:37,352 INFO L225 Difference]: With dead ends: 153 [2018-12-03 17:29:37,352 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 17:29:37,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 213 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:29:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 17:29:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 17:29:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 17:29:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-12-03 17:29:37,367 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-12-03 17:29:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:37,367 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-12-03 17:29:37,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:29:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-12-03 17:29:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 17:29:37,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:37,368 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:37,368 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:37,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1261702667, now seen corresponding path program 64 times [2018-12-03 17:29:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:37,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:37,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:38,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:38,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:38,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:38,974 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:29:38,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:38,975 INFO 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:29:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:38,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:39,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:39,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:29:43,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:43,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:29:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:29:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:29:43,952 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 67 states. [2018-12-03 17:29:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:44,150 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-03 17:29:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:29:44,151 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 141 [2018-12-03 17:29:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:44,152 INFO L225 Difference]: With dead ends: 155 [2018-12-03 17:29:44,152 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 17:29:44,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:29:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 17:29:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 17:29:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 17:29:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 17:29:44,173 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-12-03 17:29:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:44,173 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 17:29:44,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:29:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 17:29:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 17:29:44,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:44,174 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:44,174 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:44,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1454793585, now seen corresponding path program 65 times [2018-12-03 17:29:44,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:44,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:44,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:44,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:44,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:46,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:46,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:46,793 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:29:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:46,794 INFO 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:29:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:46,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:46,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 17:29:46,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:46,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:46,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:51,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:51,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:29:51,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:51,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:29:51,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:29:51,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:29:51,929 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 68 states. [2018-12-03 17:29:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:52,722 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-12-03 17:29:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:29:52,722 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 143 [2018-12-03 17:29:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:52,723 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:29:52,723 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 17:29:52,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:29:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 17:29:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 17:29:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 17:29:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 17:29:52,741 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-12-03 17:29:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:52,741 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 17:29:52,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:29:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 17:29:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 17:29:52,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:52,742 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:52,742 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:52,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash -667575789, now seen corresponding path program 66 times [2018-12-03 17:29:52,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:52,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:52,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:52,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:52,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:54,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:54,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:54,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:29:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:54,447 INFO 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:29:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:54,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:54,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:54,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:54,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:54,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:29:59,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:59,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:29:59,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:59,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:29:59,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:29:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:29:59,602 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 69 states. [2018-12-03 17:29:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:59,761 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-12-03 17:29:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:29:59,761 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 145 [2018-12-03 17:29:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:59,762 INFO L225 Difference]: With dead ends: 159 [2018-12-03 17:29:59,762 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 17:29:59,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:29:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 17:29:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 17:29:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 17:29:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 17:29:59,780 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-12-03 17:29:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:59,781 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 17:29:59,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:29:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 17:29:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 17:29:59,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:59,782 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:29:59,782 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:59,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -65517929, now seen corresponding path program 67 times [2018-12-03 17:29:59,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:59,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:59,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:59,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:59,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:01,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:01,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:01,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:01,615 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:30:01,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:01,615 INFO 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:30:01,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:01,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:01,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:01,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:07,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:07,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:30:07,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:07,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:30:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:30:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:30:07,019 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 70 states. [2018-12-03 17:30:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:07,261 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-03 17:30:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:30:07,262 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 147 [2018-12-03 17:30:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:07,262 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:30:07,262 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 17:30:07,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:30:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 17:30:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 17:30:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 17:30:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 17:30:07,283 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-12-03 17:30:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:07,283 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 17:30:07,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:30:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 17:30:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 17:30:07,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:07,285 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:07,285 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:07,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:07,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1308499429, now seen corresponding path program 68 times [2018-12-03 17:30:07,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:09,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:09,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:09,127 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:30:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:09,127 INFO 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:30:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:09,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:09,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 17:30:09,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:09,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:09,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:14,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:14,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:30:14,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:14,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:30:14,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:30:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:30:14,842 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 71 states. [2018-12-03 17:30:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:15,124 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-12-03 17:30:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:30:15,124 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 149 [2018-12-03 17:30:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:15,125 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:30:15,125 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 17:30:15,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:30:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 17:30:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 17:30:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 17:30:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 17:30:15,140 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-12-03 17:30:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:15,140 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 17:30:15,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:30:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 17:30:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 17:30:15,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:15,141 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:15,142 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:15,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1812812641, now seen corresponding path program 69 times [2018-12-03 17:30:15,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:15,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:15,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:17,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:17,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:17,222 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:30:17,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,222 INFO 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:30:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:17,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:17,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:17,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:17,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:17,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:30:22,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:30:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:30:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:30:22,883 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 72 states. [2018-12-03 17:30:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:23,055 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-12-03 17:30:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:30:23,056 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 151 [2018-12-03 17:30:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:23,056 INFO L225 Difference]: With dead ends: 165 [2018-12-03 17:30:23,056 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 17:30:23,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:30:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 17:30:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 17:30:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 17:30:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-12-03 17:30:23,072 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-12-03 17:30:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:23,072 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-12-03 17:30:23,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:30:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-12-03 17:30:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 17:30:23,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:23,073 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:23,073 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:23,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1126504925, now seen corresponding path program 70 times [2018-12-03 17:30:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:23,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:23,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:24,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:24,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:24,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:24,962 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:30:24,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:24,962 INFO 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:30:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:24,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:25,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:25,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:31,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:30:31,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:31,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:30:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:30:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:30:31,066 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 73 states. [2018-12-03 17:30:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:31,283 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-03 17:30:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:30:31,284 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 153 [2018-12-03 17:30:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:31,285 INFO L225 Difference]: With dead ends: 167 [2018-12-03 17:30:31,285 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 17:30:31,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 234 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:30:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 17:30:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 17:30:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 17:30:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 17:30:31,301 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-12-03 17:30:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:31,301 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 17:30:31,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:30:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 17:30:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 17:30:31,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:31,302 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:31,302 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:31,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1285213863, now seen corresponding path program 71 times [2018-12-03 17:30:31,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:31,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:31,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:33,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:33,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:33,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:33,257 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:30:33,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:33,258 INFO 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:30:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:33,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:33,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 17:30:33,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:33,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:33,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:39,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:39,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:30:39,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:39,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:30:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:30:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:30:39,367 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 74 states. [2018-12-03 17:30:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:39,763 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-12-03 17:30:39,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:30:39,763 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 155 [2018-12-03 17:30:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:39,765 INFO L225 Difference]: With dead ends: 169 [2018-12-03 17:30:39,765 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:30:39,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:30:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:30:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 17:30:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 17:30:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 17:30:39,787 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-12-03 17:30:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 17:30:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:30:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 17:30:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 17:30:39,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:39,788 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:39,788 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:39,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -335370709, now seen corresponding path program 72 times [2018-12-03 17:30:39,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:39,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:39,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:41,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:41,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:41,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:41,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:41,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:41,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:41,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:42,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:42,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:42,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:42,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:48,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:48,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:30:48,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:48,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:30:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:30:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:30:48,009 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 75 states. [2018-12-03 17:30:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:48,166 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-12-03 17:30:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:30:48,167 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 157 [2018-12-03 17:30:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:48,167 INFO L225 Difference]: With dead ends: 171 [2018-12-03 17:30:48,168 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 17:30:48,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:30:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 17:30:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 17:30:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 17:30:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 17:30:48,189 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-12-03 17:30:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 17:30:48,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:30:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 17:30:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:30:48,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:48,190 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:48,190 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:48,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1355984047, now seen corresponding path program 73 times [2018-12-03 17:30:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:48,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:48,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:50,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:50,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:50,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:50,223 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:30:50,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:50,223 INFO 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:30:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:50,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:50,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:50,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:56,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:56,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:30:56,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:56,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:30:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:30:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:30:56,656 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 76 states. [2018-12-03 17:30:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:56,885 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-12-03 17:30:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:30:56,886 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 159 [2018-12-03 17:30:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:56,887 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:30:56,887 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 17:30:56,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 243 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:30:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 17:30:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 17:30:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 17:30:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 17:30:56,907 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-12-03 17:30:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:56,908 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 17:30:56,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:30:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 17:30:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 17:30:56,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:56,909 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:30:56,909 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:56,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1044700621, now seen corresponding path program 74 times [2018-12-03 17:30:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:56,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:56,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:59,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:59,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:59,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:59,084 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:30:59,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:59,084 INFO 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:30:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:59,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:59,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 17:30:59,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:59,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:30:59,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:05,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:31:05,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:05,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:31:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:31:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:31:05,563 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 77 states. [2018-12-03 17:31:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:05,804 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-12-03 17:31:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:31:05,805 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 161 [2018-12-03 17:31:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:05,805 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:31:05,806 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 17:31:05,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 246 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:31:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 17:31:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 17:31:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 17:31:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 17:31:05,827 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-12-03 17:31:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:05,827 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 17:31:05,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:31:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 17:31:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 17:31:05,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:05,828 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:05,829 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:05,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1705228617, now seen corresponding path program 75 times [2018-12-03 17:31:05,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:05,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:05,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:05,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:05,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:08,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:08,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:08,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:08,346 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:31:08,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:08,346 INFO 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:31:08,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:08,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:08,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:08,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:08,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:08,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:14,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:14,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:31:14,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:14,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:31:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:31:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:31:14,837 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 78 states. [2018-12-03 17:31:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:15,067 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-12-03 17:31:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:31:15,068 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 163 [2018-12-03 17:31:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:15,068 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:31:15,068 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 17:31:15,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:31:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 17:31:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 17:31:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 17:31:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-12-03 17:31:15,084 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 163 [2018-12-03 17:31:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:15,085 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-12-03 17:31:15,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:31:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-12-03 17:31:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 17:31:15,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:15,085 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:15,086 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:15,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -817472965, now seen corresponding path program 76 times [2018-12-03 17:31:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:15,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:15,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:15,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:17,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:17,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:17,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:17,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:17,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:17,511 INFO 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:31:17,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:17,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:17,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:17,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:31:24,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:31:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:31:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:31:24,340 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 79 states. [2018-12-03 17:31:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:24,594 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-12-03 17:31:24,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:31:24,595 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 165 [2018-12-03 17:31:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:24,596 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:31:24,596 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 17:31:24,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:31:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 17:31:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 17:31:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 17:31:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-03 17:31:24,612 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 165 [2018-12-03 17:31:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:24,612 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-03 17:31:24,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:31:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-03 17:31:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 17:31:24,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:24,613 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:24,613 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:24,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1912183999, now seen corresponding path program 77 times [2018-12-03 17:31:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:24,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:24,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:27,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:27,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:27,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:27,193 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:31:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:27,193 INFO 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:31:27,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:27,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:27,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 17:31:27,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:27,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:27,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:31:34,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:31:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:31:34,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:31:34,435 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 80 states. [2018-12-03 17:31:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:34,709 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-12-03 17:31:34,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:31:34,710 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 167 [2018-12-03 17:31:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:34,711 INFO L225 Difference]: With dead ends: 181 [2018-12-03 17:31:34,711 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 17:31:34,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:31:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 17:31:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 17:31:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 17:31:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-12-03 17:31:34,728 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 167 [2018-12-03 17:31:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:34,728 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-12-03 17:31:34,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:31:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-12-03 17:31:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 17:31:34,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:34,729 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:34,729 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:34,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash 887508547, now seen corresponding path program 78 times [2018-12-03 17:31:34,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:37,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:37,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:37,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:37,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:37,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:31:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:37,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:37,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:37,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:37,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:37,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:31:44,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:44,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:31:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:31:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:31:44,511 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 81 states. [2018-12-03 17:31:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:44,716 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-12-03 17:31:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:31:44,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 169 [2018-12-03 17:31:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:44,718 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:31:44,718 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 17:31:44,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:31:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 17:31:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 17:31:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 17:31:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-12-03 17:31:44,734 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 169 [2018-12-03 17:31:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:44,734 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-12-03 17:31:44,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:31:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-12-03 17:31:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 17:31:44,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:44,735 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:44,735 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:44,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash -278090041, now seen corresponding path program 79 times [2018-12-03 17:31:44,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:44,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:44,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:47,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:47,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:47,115 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:31:47,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,115 INFO 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:31:47,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:47,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:47,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:54,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:54,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:31:54,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:54,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:31:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:31:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:31:54,579 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 82 states. [2018-12-03 17:31:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:54,812 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-12-03 17:31:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:31:54,813 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 171 [2018-12-03 17:31:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:54,813 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:31:54,814 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 17:31:54,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:31:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 17:31:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 17:31:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 17:31:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-12-03 17:31:54,834 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 171 [2018-12-03 17:31:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:54,834 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-12-03 17:31:54,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:31:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-12-03 17:31:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 17:31:54,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:54,835 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:31:54,835 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:54,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 568131147, now seen corresponding path program 80 times [2018-12-03 17:31:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:54,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:54,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:57,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:57,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:57,328 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:31:57,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:57,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:57,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 17:31:57,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:57,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:31:57,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:05,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:05,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:32:05,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:05,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:32:05,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:32:05,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:32:05,008 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 83 states. [2018-12-03 17:32:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:05,303 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-12-03 17:32:05,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:32:05,303 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 173 [2018-12-03 17:32:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:05,304 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:32:05,304 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 17:32:05,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:32:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 17:32:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 17:32:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 17:32:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-12-03 17:32:05,328 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 173 [2018-12-03 17:32:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:05,328 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-12-03 17:32:05,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:32:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-12-03 17:32:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 17:32:05,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:05,329 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:32:05,330 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:05,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2037873871, now seen corresponding path program 81 times [2018-12-03 17:32:05,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:08,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:08,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:08,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:08,211 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:32:08,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:08,211 INFO 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:32:08,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:08,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:08,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:08,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:08,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:08,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:32:15,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:15,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:32:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:32:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:32:15,638 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 84 states. [2018-12-03 17:32:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:15,924 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-12-03 17:32:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:32:15,925 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 175 [2018-12-03 17:32:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:15,926 INFO L225 Difference]: With dead ends: 189 [2018-12-03 17:32:15,926 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 17:32:15,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:32:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 17:32:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 17:32:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 17:32:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-12-03 17:32:15,943 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 175 [2018-12-03 17:32:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-12-03 17:32:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:32:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-12-03 17:32:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 17:32:15,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:15,944 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:32:15,944 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:15,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1416391251, now seen corresponding path program 82 times [2018-12-03 17:32:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:15,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:15,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:18,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:18,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:18,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:32:18,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,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 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:32:18,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:18,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:18,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:32:26,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:26,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:32:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:32:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:32:26,599 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 85 states. [2018-12-03 17:32:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:26,921 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-12-03 17:32:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:32:26,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 177 [2018-12-03 17:32:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:26,923 INFO L225 Difference]: With dead ends: 191 [2018-12-03 17:32:26,923 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 17:32:26,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:32:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 17:32:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 17:32:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 17:32:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-12-03 17:32:26,942 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 177 [2018-12-03 17:32:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:26,942 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-12-03 17:32:26,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:32:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-12-03 17:32:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 17:32:26,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:26,943 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:32:26,944 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:26,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1172047575, now seen corresponding path program 83 times [2018-12-03 17:32:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:26,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:29,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:29,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:29,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:29,777 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:32:29,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:29,777 INFO 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:32:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:29,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:30,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 17:32:30,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:30,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:30,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:37,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:37,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:32:37,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:37,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:32:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:32:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:32:37,833 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 86 states. [2018-12-03 17:32:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:38,027 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-12-03 17:32:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:32:38,027 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 179 [2018-12-03 17:32:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:38,028 INFO L225 Difference]: With dead ends: 193 [2018-12-03 17:32:38,029 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 17:32:38,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:32:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 17:32:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 17:32:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:32:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-03 17:32:38,047 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 179 [2018-12-03 17:32:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:38,047 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-03 17:32:38,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:32:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-03 17:32:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 17:32:38,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:38,048 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:32:38,049 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:38,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1713991077, now seen corresponding path program 84 times [2018-12-03 17:32:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:40,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:40,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:40,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:40,918 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:32:40,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:40,918 INFO 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:32:40,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:40,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:41,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:41,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:41,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:41,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:49,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:49,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:32:49,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:49,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:32:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:32:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:32:49,230 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 87 states. [2018-12-03 17:32:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:49,569 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2018-12-03 17:32:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:32:49,570 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 181 [2018-12-03 17:32:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:49,571 INFO L225 Difference]: With dead ends: 195 [2018-12-03 17:32:49,571 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 17:32:49,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:32:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 17:32:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 17:32:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 17:32:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-12-03 17:32:49,588 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 181 [2018-12-03 17:32:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:49,589 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-12-03 17:32:49,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:32:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-12-03 17:32:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 17:32:49,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:49,589 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:32:49,590 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:49,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash -648262433, now seen corresponding path program 85 times [2018-12-03 17:32:49,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:49,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:49,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:52,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:52,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:52,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:52,315 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:32:52,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:52,315 INFO 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:32:52,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:52,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:52,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:32:52,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:00,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:33:00,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:00,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:33:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:33:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:33:00,745 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 88 states. [2018-12-03 17:33:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:01,016 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-12-03 17:33:01,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:33:01,017 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 183 [2018-12-03 17:33:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:01,017 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:33:01,018 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 17:33:01,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:33:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 17:33:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 17:33:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 17:33:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-12-03 17:33:01,039 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2018-12-03 17:33:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:01,039 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-12-03 17:33:01,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:33:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-12-03 17:33:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 17:33:01,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:01,040 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:33:01,041 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:01,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1314748003, now seen corresponding path program 86 times [2018-12-03 17:33:01,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:01,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:01,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:01,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:01,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:03,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:03,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:03,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:03,857 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:33:03,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:03,857 INFO 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:33:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:03,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:04,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 17:33:04,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:04,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:04,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:12,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:12,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:33:12,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:12,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:33:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:33:12,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:33:12,535 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 89 states. [2018-12-03 17:33:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:12,784 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-12-03 17:33:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:33:12,784 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 185 [2018-12-03 17:33:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:12,785 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:33:12,785 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 17:33:12,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 282 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:33:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 17:33:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 17:33:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 17:33:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-12-03 17:33:12,808 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 185 [2018-12-03 17:33:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:12,808 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-12-03 17:33:12,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:33:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-12-03 17:33:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 17:33:12,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:12,809 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:33:12,809 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:12,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2017833241, now seen corresponding path program 87 times [2018-12-03 17:33:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:12,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:12,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:12,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:12,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:15,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:15,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:15,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:15,988 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:33:15,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:15,988 INFO 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:33:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:15,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:16,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:16,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:16,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:16,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:24,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:24,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:33:24,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:24,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:33:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:33:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:33:24,793 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 90 states. [2018-12-03 17:33:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:25,027 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-12-03 17:33:25,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:33:25,027 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 187 [2018-12-03 17:33:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:25,029 INFO L225 Difference]: With dead ends: 201 [2018-12-03 17:33:25,029 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 17:33:25,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:33:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 17:33:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 17:33:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 17:33:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-12-03 17:33:25,050 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 187 [2018-12-03 17:33:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:25,051 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-12-03 17:33:25,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:33:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-12-03 17:33:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 17:33:25,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:25,052 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:33:25,052 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:25,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash -582805909, now seen corresponding path program 88 times [2018-12-03 17:33:25,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:25,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:25,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:25,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:28,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:28,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:28,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:28,080 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:33:28,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:28,080 INFO 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:33:28,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:28,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:28,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:28,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:37,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:37,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:33:37,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:37,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:33:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:33:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:33:37,220 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 91 states. [2018-12-03 17:33:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:37,501 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2018-12-03 17:33:37,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:33:37,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 189 [2018-12-03 17:33:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:37,502 INFO L225 Difference]: With dead ends: 203 [2018-12-03 17:33:37,503 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 17:33:37,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:33:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 17:33:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 17:33:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 17:33:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-12-03 17:33:37,522 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 189 [2018-12-03 17:33:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:37,522 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-12-03 17:33:37,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:33:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-12-03 17:33:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 17:33:37,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:37,523 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:33:37,523 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:37,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash -206041873, now seen corresponding path program 89 times [2018-12-03 17:33:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:37,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:37,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:40,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:40,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:40,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:40,818 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:33:40,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:40,818 INFO 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:33:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:40,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:41,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 17:33:41,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:41,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:41,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:50,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:50,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:33:50,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:50,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:33:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:33:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:33:50,028 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 92 states. [2018-12-03 17:33:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:50,435 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-12-03 17:33:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:33:50,436 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 191 [2018-12-03 17:33:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:50,437 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:33:50,437 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 17:33:50,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:33:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 17:33:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 17:33:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 17:33:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2018-12-03 17:33:50,456 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 191 [2018-12-03 17:33:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2018-12-03 17:33:50,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:33:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2018-12-03 17:33:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 17:33:50,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:50,457 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:33:50,457 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:50,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1086943859, now seen corresponding path program 90 times [2018-12-03 17:33:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:50,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:50,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:53,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:53,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:53,564 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:33:53,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:53,564 INFO 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:33:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:53,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:53,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:53,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:33:53,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:02,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:34:02,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:02,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:34:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:34:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:34:02,983 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 93 states. [2018-12-03 17:34:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:03,238 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2018-12-03 17:34:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:34:03,239 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 193 [2018-12-03 17:34:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:03,240 INFO L225 Difference]: With dead ends: 207 [2018-12-03 17:34:03,240 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 17:34:03,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:34:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 17:34:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 17:34:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 17:34:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-03 17:34:03,260 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 193 [2018-12-03 17:34:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:03,260 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-03 17:34:03,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:34:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-03 17:34:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 17:34:03,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:03,261 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:34:03,261 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:03,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1894283529, now seen corresponding path program 91 times [2018-12-03 17:34:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:03,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:03,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:06,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:06,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:06,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:06,676 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:34:06,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:06,677 INFO 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:34:06,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:06,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:06,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:06,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:16,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:16,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:34:16,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:16,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:34:16,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:34:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:34:16,368 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 94 states. [2018-12-03 17:34:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:16,622 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-12-03 17:34:16,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:34:16,622 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 195 [2018-12-03 17:34:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:16,623 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:34:16,623 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 17:34:16,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:34:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 17:34:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 17:34:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 17:34:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2018-12-03 17:34:16,643 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 195 [2018-12-03 17:34:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:16,643 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2018-12-03 17:34:16,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:34:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2018-12-03 17:34:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 17:34:16,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:16,644 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:34:16,644 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:16,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2110616965, now seen corresponding path program 92 times [2018-12-03 17:34:16,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:16,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:20,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:20,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:20,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:20,059 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:34:20,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:20,059 INFO 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:34:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:20,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:20,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 17:34:20,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:20,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:20,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:29,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:29,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:34:29,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:29,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:34:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:34:29,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:34:29,922 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 95 states. [2018-12-03 17:34:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:30,324 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-12-03 17:34:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:34:30,324 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 197 [2018-12-03 17:34:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:30,325 INFO L225 Difference]: With dead ends: 211 [2018-12-03 17:34:30,325 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 17:34:30,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:34:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 17:34:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-03 17:34:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 17:34:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-12-03 17:34:30,344 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 197 [2018-12-03 17:34:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:30,344 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-12-03 17:34:30,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:34:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-12-03 17:34:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 17:34:30,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:30,345 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:34:30,345 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:30,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 446348543, now seen corresponding path program 93 times [2018-12-03 17:34:30,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:30,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:30,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:30,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:33,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:33,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:33,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:33,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:33,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:33,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:33,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:33,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:33,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:34,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:34,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:43,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:43,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:34:43,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:43,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:34:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:34:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:34:43,852 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 96 states. [2018-12-03 17:34:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:44,192 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-12-03 17:34:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:34:44,192 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 199 [2018-12-03 17:34:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:44,193 INFO L225 Difference]: With dead ends: 213 [2018-12-03 17:34:44,193 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 17:34:44,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:34:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 17:34:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-12-03 17:34:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 17:34:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2018-12-03 17:34:44,213 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 199 [2018-12-03 17:34:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:44,213 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2018-12-03 17:34:44,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:34:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-12-03 17:34:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 17:34:44,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:44,215 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:34:44,215 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:44,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash 968908419, now seen corresponding path program 94 times [2018-12-03 17:34:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:44,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:44,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:44,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:44,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:47,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:47,834 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:34:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,835 INFO 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:34:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:47,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:47,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:48,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:34:58,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:58,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:34:58,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:58,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:34:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:34:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:34:58,146 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 97 states. [2018-12-03 17:34:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:58,398 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2018-12-03 17:34:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:34:58,400 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 201 [2018-12-03 17:34:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:58,401 INFO L225 Difference]: With dead ends: 215 [2018-12-03 17:34:58,401 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 17:34:58,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:34:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 17:34:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 17:34:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 17:34:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-12-03 17:34:58,421 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 201 [2018-12-03 17:34:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:58,421 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-12-03 17:34:58,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:34:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-12-03 17:34:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 17:34:58,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:58,422 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:34:58,422 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:58,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 637775623, now seen corresponding path program 95 times [2018-12-03 17:34:58,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:58,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:02,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:02,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:02,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:02,128 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:35:02,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:02,128 INFO 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:35:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:02,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:02,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 17:35:02,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:02,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:02,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:12,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:12,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:35:12,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:12,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:35:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:35:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:35:12,715 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 98 states. [2018-12-03 17:35:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:13,125 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-12-03 17:35:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:35:13,125 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 203 [2018-12-03 17:35:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:13,127 INFO L225 Difference]: With dead ends: 217 [2018-12-03 17:35:13,127 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 17:35:13,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:35:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 17:35:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 17:35:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 17:35:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-03 17:35:13,146 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 203 [2018-12-03 17:35:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:13,147 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-03 17:35:13,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:35:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-03 17:35:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 17:35:13,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:13,148 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:35:13,148 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:13,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 246738571, now seen corresponding path program 96 times [2018-12-03 17:35:13,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:13,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:13,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:16,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:16,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:16,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:16,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:35:16,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:16,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 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:35:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:16,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:16,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:16,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:16,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:16,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:35:27,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:35:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:35:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:35:27,110 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 99 states. [2018-12-03 17:35:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:27,486 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-12-03 17:35:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:35:27,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 205 [2018-12-03 17:35:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:27,487 INFO L225 Difference]: With dead ends: 219 [2018-12-03 17:35:27,488 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 17:35:27,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:35:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 17:35:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-12-03 17:35:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 17:35:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-12-03 17:35:27,507 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 205 [2018-12-03 17:35:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:27,507 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-12-03 17:35:27,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:35:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-12-03 17:35:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 17:35:27,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:27,508 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:35:27,508 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:27,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1877713649, now seen corresponding path program 97 times [2018-12-03 17:35:27,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:27,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:27,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:31,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:31,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:31,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:31,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:31,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:31,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 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:35:31,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:31,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:31,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:31,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:41,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:41,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:35:41,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:41,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:35:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:35:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:35:41,751 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 100 states. [2018-12-03 17:35:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:42,206 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-12-03 17:35:42,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:35:42,207 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 207 [2018-12-03 17:35:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:42,208 INFO L225 Difference]: With dead ends: 221 [2018-12-03 17:35:42,208 INFO L226 Difference]: Without dead ends: 210 [2018-12-03 17:35:42,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 315 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:35:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-03 17:35:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-12-03 17:35:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 17:35:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-03 17:35:42,229 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 207 [2018-12-03 17:35:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:42,229 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-03 17:35:42,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:35:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-03 17:35:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 17:35:42,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:42,230 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:35:42,230 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:42,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash 928135827, now seen corresponding path program 98 times [2018-12-03 17:35:42,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:42,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:42,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:46,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:46,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:46,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:46,093 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:35:46,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:46,093 INFO 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:35:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:46,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:46,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 17:35:46,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:46,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:46,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:35:57,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:57,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:35:57,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:57,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:35:57,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:35:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:35:57,324 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 101 states. [2018-12-03 17:35:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:57,817 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-12-03 17:35:57,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:35:57,817 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 209 [2018-12-03 17:35:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:57,819 INFO L225 Difference]: With dead ends: 223 [2018-12-03 17:35:57,819 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 17:35:57,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:35:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 17:35:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-12-03 17:35:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 17:35:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-12-03 17:35:57,843 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 209 [2018-12-03 17:35:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-12-03 17:35:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:35:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-12-03 17:35:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 17:35:57,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:57,845 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:35:57,845 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 110020375, now seen corresponding path program 99 times [2018-12-03 17:35:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:01,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:01,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:01,723 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:36:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:01,723 INFO 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:36:01,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:01,733 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:01,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:01,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:01,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:01,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:36:13,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:36:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:36:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:36:13,257 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 102 states. [2018-12-03 17:36:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:13,773 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-03 17:36:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:36:13,774 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 211 [2018-12-03 17:36:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:13,774 INFO L225 Difference]: With dead ends: 225 [2018-12-03 17:36:13,775 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 17:36:13,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:36:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 17:36:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-12-03 17:36:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-03 17:36:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2018-12-03 17:36:13,794 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2018-12-03 17:36:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:13,794 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2018-12-03 17:36:13,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:36:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2018-12-03 17:36:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 17:36:13,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:13,795 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:36:13,795 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:13,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -119913829, now seen corresponding path program 100 times [2018-12-03 17:36:13,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:13,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:13,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:13,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:17,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:17,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:17,522 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:17,523 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:36:17,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:17,523 INFO 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:36:17,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:17,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:17,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:17,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:29,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:29,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:36:29,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:36:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:36:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:36:29,465 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 103 states. [2018-12-03 17:36:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:29,861 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-12-03 17:36:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:36:29,861 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 213 [2018-12-03 17:36:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:29,862 INFO L225 Difference]: With dead ends: 227 [2018-12-03 17:36:29,862 INFO L226 Difference]: Without dead ends: 216 [2018-12-03 17:36:29,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:36:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-03 17:36:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-12-03 17:36:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-03 17:36:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-12-03 17:36:29,883 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 213 [2018-12-03 17:36:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:29,883 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-12-03 17:36:29,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:36:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-12-03 17:36:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-03 17:36:29,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:29,884 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:36:29,884 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:29,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2043351777, now seen corresponding path program 101 times [2018-12-03 17:36:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:29,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:29,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:29,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:33,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:33,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:33,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:33,702 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:36:33,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:33,702 INFO 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:36:33,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:33,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:34,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2018-12-03 17:36:34,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:34,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:34,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:45,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:45,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:36:45,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:45,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:36:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:36:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:36:45,836 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 104 states. [2018-12-03 17:36:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:46,275 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-12-03 17:36:46,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:36:46,275 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 215 [2018-12-03 17:36:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:46,276 INFO L225 Difference]: With dead ends: 229 [2018-12-03 17:36:46,276 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 17:36:46,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:36:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 17:36:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-03 17:36:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-03 17:36:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2018-12-03 17:36:46,300 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 215 [2018-12-03 17:36:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:46,300 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2018-12-03 17:36:46,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:36:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2018-12-03 17:36:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-03 17:36:46,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:46,301 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:36:46,301 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:46,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:46,302 INFO L82 PathProgramCache]: Analyzing trace with hash 663684771, now seen corresponding path program 102 times [2018-12-03 17:36:46,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:46,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:46,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:50,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:50,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:50,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:50,521 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:36:50,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:50,522 INFO 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:36:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:50,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:50,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:50,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:50,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:36:50,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:02,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:02,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:37:02,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:02,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:37:02,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:37:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:37:02,369 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 105 states. [2018-12-03 17:37:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:02,675 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-12-03 17:37:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:37:02,675 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 217 [2018-12-03 17:37:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:02,676 INFO L225 Difference]: With dead ends: 231 [2018-12-03 17:37:02,676 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 17:37:02,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:37:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 17:37:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-03 17:37:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 17:37:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-03 17:37:02,704 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 217 [2018-12-03 17:37:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:02,705 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-03 17:37:02,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:37:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-03 17:37:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 17:37:02,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:02,706 INFO L402 BasicCegarLoop]: trace histogram [104, 103, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:37:02,706 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:02,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -624373977, now seen corresponding path program 103 times [2018-12-03 17:37:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:02,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:02,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:02,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:02,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:06,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:06,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:06,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:06,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:06,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:06,909 INFO 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:37:06,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:06,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:07,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:07,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:19,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:19,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:37:19,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:19,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:37:19,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:37:19,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:37:19,175 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 106 states. [2018-12-03 17:37:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:19,767 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-12-03 17:37:19,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:37:19,767 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 219 [2018-12-03 17:37:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:19,768 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:37:19,768 INFO L226 Difference]: Without dead ends: 222 [2018-12-03 17:37:19,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:37:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-03 17:37:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-12-03 17:37:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-03 17:37:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2018-12-03 17:37:19,797 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 219 [2018-12-03 17:37:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:19,797 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 224 transitions. [2018-12-03 17:37:19,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:37:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 224 transitions. [2018-12-03 17:37:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-03 17:37:19,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:19,798 INFO L402 BasicCegarLoop]: trace histogram [105, 104, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:37:19,799 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:19,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1498249557, now seen corresponding path program 104 times [2018-12-03 17:37:19,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:19,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:19,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:24,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:24,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:24,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:24,133 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:37:24,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:24,133 INFO 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:37:24,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:24,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:24,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2018-12-03 17:37:24,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:24,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:24,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:37:36,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:36,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:37:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:37:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:37:36,973 INFO L87 Difference]: Start difference. First operand 222 states and 224 transitions. Second operand 107 states. [2018-12-03 17:37:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:37,520 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-12-03 17:37:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:37:37,520 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 221 [2018-12-03 17:37:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:37,521 INFO L225 Difference]: With dead ends: 235 [2018-12-03 17:37:37,521 INFO L226 Difference]: Without dead ends: 224 [2018-12-03 17:37:37,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:37:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-03 17:37:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-12-03 17:37:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-03 17:37:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-12-03 17:37:37,542 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 221 [2018-12-03 17:37:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:37,542 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-12-03 17:37:37,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:37:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-12-03 17:37:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-03 17:37:37,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:37,543 INFO L402 BasicCegarLoop]: trace histogram [106, 105, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:37:37,543 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:37,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash 520908079, now seen corresponding path program 105 times [2018-12-03 17:37:37,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:37,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:37,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:41,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:41,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:41,856 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:37:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:41,856 INFO 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:37:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:41,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:42,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:42,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:42,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:42,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:54,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:54,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:37:54,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:54,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:37:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:37:54,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:37:54,439 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 108 states. [2018-12-03 17:37:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:55,014 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-12-03 17:37:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:37:55,014 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 223 [2018-12-03 17:37:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:55,015 INFO L225 Difference]: With dead ends: 237 [2018-12-03 17:37:55,015 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 17:37:55,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:37:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 17:37:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-03 17:37:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-03 17:37:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-12-03 17:37:55,036 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 223 [2018-12-03 17:37:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:55,037 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-12-03 17:37:55,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:37:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-12-03 17:37:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-03 17:37:55,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:55,037 INFO L402 BasicCegarLoop]: trace histogram [107, 106, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:37:55,038 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:55,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:55,038 INFO L82 PathProgramCache]: Analyzing trace with hash -393821517, now seen corresponding path program 106 times [2018-12-03 17:37:55,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:55,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:55,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:59,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:59,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:59,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:59,538 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:37:59,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:59,538 INFO 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:37:59,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:59,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:59,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:37:59,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:12,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:12,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:38:12,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:12,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:38:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:38:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:38:12,607 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 109 states. [2018-12-03 17:38:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:12,921 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-12-03 17:38:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:38:12,922 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 225 [2018-12-03 17:38:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:12,923 INFO L225 Difference]: With dead ends: 239 [2018-12-03 17:38:12,923 INFO L226 Difference]: Without dead ends: 228 [2018-12-03 17:38:12,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:38:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-03 17:38:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-12-03 17:38:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 17:38:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-12-03 17:38:12,951 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 225 [2018-12-03 17:38:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:12,952 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-12-03 17:38:12,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:38:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-12-03 17:38:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-03 17:38:12,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:12,953 INFO L402 BasicCegarLoop]: trace histogram [108, 107, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:38:12,953 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:12,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1019332407, now seen corresponding path program 107 times [2018-12-03 17:38:12,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:12,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:12,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:17,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:17,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:17,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:17,453 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:38:17,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:17,453 INFO 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:38:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:17,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:17,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2018-12-03 17:38:17,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:17,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:17,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:30,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:38:30,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:30,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:38:30,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:38:30,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:38:30,722 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 110 states. [2018-12-03 17:38:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:31,275 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-12-03 17:38:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:38:31,275 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 227 [2018-12-03 17:38:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:31,276 INFO L225 Difference]: With dead ends: 241 [2018-12-03 17:38:31,276 INFO L226 Difference]: Without dead ends: 230 [2018-12-03 17:38:31,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:38:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-03 17:38:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-12-03 17:38:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-03 17:38:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-12-03 17:38:31,297 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 227 [2018-12-03 17:38:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:31,297 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-12-03 17:38:31,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:38:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-12-03 17:38:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-03 17:38:31,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:31,298 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:38:31,298 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:31,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1850587835, now seen corresponding path program 108 times [2018-12-03 17:38:31,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:31,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:31,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:35,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:35,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:35,838 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:38:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:35,839 INFO 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:38:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:35,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:35,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:35,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:36,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:49,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:38:49,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:49,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:38:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:38:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:38:49,303 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 111 states. [2018-12-03 17:38:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:49,774 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-12-03 17:38:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:38:49,774 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 229 [2018-12-03 17:38:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:49,775 INFO L225 Difference]: With dead ends: 243 [2018-12-03 17:38:49,775 INFO L226 Difference]: Without dead ends: 232 [2018-12-03 17:38:49,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:38:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-03 17:38:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-12-03 17:38:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 17:38:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-12-03 17:38:49,800 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 229 [2018-12-03 17:38:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:49,800 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-12-03 17:38:49,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:38:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-12-03 17:38:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 17:38:49,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:49,801 INFO L402 BasicCegarLoop]: trace histogram [110, 109, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:38:49,801 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:49,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1823137087, now seen corresponding path program 109 times [2018-12-03 17:38:49,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:49,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:49,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:54,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:54,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:54,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:54,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:54,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:54,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:54,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:54,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:38:54,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:39:08,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:08,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:39:08,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:08,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:39:08,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:39:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:39:08,065 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 112 states. [2018-12-03 17:39:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:08,654 INFO L93 Difference]: Finished difference Result 245 states and 249 transitions. [2018-12-03 17:39:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:39:08,654 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 231 [2018-12-03 17:39:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:08,655 INFO L225 Difference]: With dead ends: 245 [2018-12-03 17:39:08,655 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 17:39:08,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:39:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 17:39:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-03 17:39:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 17:39:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-12-03 17:39:08,678 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 231 [2018-12-03 17:39:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:08,678 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-12-03 17:39:08,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:39:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-12-03 17:39:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-03 17:39:08,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:08,679 INFO L402 BasicCegarLoop]: trace histogram [111, 110, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:39:08,679 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:08,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1212772035, now seen corresponding path program 110 times [2018-12-03 17:39:08,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:08,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12219 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:39:13,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:13,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:13,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:13,378 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:39:13,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:13,378 INFO 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:39:13,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:13,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)