java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:48,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:48,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:48,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:48,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:48,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:48,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:48,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:48,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:48,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:48,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:48,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:48,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:48,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:48,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:48,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:48,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:48,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:48,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:48,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:48,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:48,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:48,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:48,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:48,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:48,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:48,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:48,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:48,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:48,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:48,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:48,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:48,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:48,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:48,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:48,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:48,057 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-04 11:42:48,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:48,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:48,078 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:48,078 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:48,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:48,079 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:48,079 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:48,079 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:48,080 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:48,080 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:48,080 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:48,080 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:48,080 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:48,081 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:48,085 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:48,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:48,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:48,086 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:48,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:48,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:48,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:48,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:48,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:48,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:48,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:48,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:48,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:48,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:48,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:48,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:48,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:48,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:48,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:48,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:48,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:48,093 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:48,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:48,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:48,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:48,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:48,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:48,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:48,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:48,156 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:48,157 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:48,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-12-04 11:42:48,158 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-04 11:42:48,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:48,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:48,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:48,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:42:48,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:42:48,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:42:48,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:42:48,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:42:48,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:42:48,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (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-04 11:42:48,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:42:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:42:48,630 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:42:48,631 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-04 11:42:48,631 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48 BoogieIcfgContainer [2018-12-04 11:42:48,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:42:48,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:42:48,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:42:48,636 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:42:48,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/2) ... [2018-12-04 11:42:48,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a584a43 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:42:48, skipping insertion in model container [2018-12-04 11:42:48,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48" (2/2) ... [2018-12-04 11:42:48,641 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-04 11:42:48,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:42:48,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:42:48,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:42:48,721 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:42:48,721 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:42:48,721 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:42:48,721 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:42:48,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:42:48,722 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:42:48,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:42:48,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:42:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-04 11:42:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:42:48,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:42:48,749 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:42:48,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:48,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:48,908 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-04 11:42:48,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:48,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:42:48,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:48,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:42:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:42:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:42:48,931 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-04 11:42:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:48,999 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-04 11:42:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:42:49,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:42:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,014 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:42:49,015 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:42:49,018 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-04 11:42:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:42:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:42:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:42:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:42:49,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-04 11:42:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:42:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:42:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:42:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:42:49,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:42:49,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-04 11:42:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,238 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-04 11:42:49,240 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-04 11:42:49,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:49,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:49,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:42:49,543 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-04 11:42:49,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:42:49,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:42:49,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:42:49,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:49,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:49,707 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-04 11:42:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,752 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-04 11:42:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:49,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 11:42:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,754 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:42:49,754 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:42:49,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:42:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:42:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:42:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-04 11:42:49,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-04 11:42:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,759 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-04 11:42:49,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-04 11:42:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:42:49,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,761 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-04 11:42:49,761 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-04 11:42:49,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:49,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:49,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:49,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:42:49,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:49,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:49,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:49,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:49,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:49,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:50,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:42:50,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:50,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:50,235 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-04 11:42:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,365 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-04 11:42:50,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:42:50,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-04 11:42:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,368 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:42:50,368 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:42:50,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:42:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:42:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:42:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-04 11:42:50,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-04 11:42:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,373 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-04 11:42:50,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-04 11:42:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:42:50,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,376 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-04 11:42:50,376 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-04 11:42:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:50,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:42:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:50,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:50,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:50,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:42:50,778 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:42:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:42:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,780 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-04 11:42:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,829 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-04 11:42:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:42:50,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-04 11:42:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,831 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:42:50,832 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:42:50,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:42:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:42:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:42:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-04 11:42:50,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-04 11:42:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,837 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-04 11:42:50,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:42:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-04 11:42:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:42:50,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,838 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-04 11:42:50,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-04 11:42:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:50,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:50,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,935 INFO 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-04 11:42:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:50,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:51,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:42:51,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:42:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:42:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:51,111 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-04 11:42:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,191 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-04 11:42:51,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:42:51,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-04 11:42:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,193 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:42:51,193 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:42:51,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:42:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:42:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:42:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-04 11:42:51,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-04 11:42:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,202 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-04 11:42:51,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:42:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-04 11:42:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:42:51,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,203 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-04 11:42:51,203 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-04 11:42:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,608 INFO 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-04 11:42:51,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:51,618 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:51,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:42:51,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:42:51,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:42:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:42:51,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:51,947 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-04 11:42:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,990 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-04 11:42:51,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:42:51,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-04 11:42:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,991 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:42:51,992 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:42:51,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:42:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:42:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:42:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-04 11:42:51,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-04 11:42:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,996 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-04 11:42:51,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:42:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-04 11:42:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:42:51,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,997 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-04 11:42:51,998 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-04 11:42:51,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:52,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:52,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:52,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,114 INFO 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-04 11:42:52,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:52,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:52,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:52,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:52,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:42:52,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:42:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:42:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:42:52,574 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-04 11:42:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,648 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-04 11:42:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:42:52,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-04 11:42:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,650 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:42:52,650 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:42:52,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-04 11:42:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:42:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:42:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:42:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-04 11:42:52,656 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-04 11:42:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,656 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-04 11:42:52,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:42:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-04 11:42:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:42:52,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,657 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-04 11:42:52,657 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-04 11:42:52,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:52,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:52,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:52,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:52,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,864 INFO 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-04 11:42:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:52,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:52,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:42:53,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:42:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:42:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:53,184 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-04 11:42:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,226 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-04 11:42:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:42:53,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-04 11:42:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,229 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:42:53,229 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:42:53,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:42:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:42:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:42:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-04 11:42:53,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-04 11:42:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,234 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-04 11:42:53,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:42:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-04 11:42:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:42:53,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,235 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-04 11:42:53,235 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-04 11:42:53,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:53,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,389 INFO 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-04 11:42:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:53,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:53,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:42:53,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:53,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:42:53,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:42:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:42:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:53,687 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-04 11:42:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,864 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-04 11:42:53,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:42:53,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 11:42:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,865 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:42:53,865 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:42:53,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:42:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:42:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:42:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-04 11:42:53,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-04 11:42:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-04 11:42:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:42:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-04 11:42:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:42:53,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,876 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-04 11:42:53,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-04 11:42:53,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:54,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,252 INFO 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-04 11:42:54,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:54,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:54,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:54,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:54,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:54,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:42:54,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:42:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:42:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:54,864 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-04 11:42:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:55,003 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-04 11:42:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:42:55,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-04 11:42:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:55,004 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:42:55,004 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:42:55,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:42:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:42:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:42:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-04 11:42:55,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-04 11:42:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:55,011 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-04 11:42:55,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:42:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-04 11:42:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:42:55,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:55,012 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-04 11:42:55,012 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:55,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-04 11:42:55,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:55,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:55,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:55,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:55,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:55,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:55,366 INFO 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-04 11:42:55,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:55,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:55,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:55,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:55,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:55,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:42:55,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:55,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:42:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:42:55,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:55,959 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-04 11:42:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:56,010 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-04 11:42:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:42:56,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-04 11:42:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:56,012 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:42:56,013 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:42:56,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:42:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:42:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:42:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-04 11:42:56,017 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-04 11:42:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:56,018 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-04 11:42:56,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:42:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-04 11:42:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:42:56,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:56,019 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-04 11:42:56,019 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:56,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-04 11:42:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:56,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:56,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:56,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:56,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,214 INFO 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-04 11:42:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:56,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:56,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:42:56,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:56,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:56,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:56,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:56,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-04 11:42:56,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:56,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:42:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:42:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:42:56,551 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-04 11:42:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:56,601 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-04 11:42:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:42:56,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-04 11:42:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:56,603 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:42:56,603 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:42:56,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 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-04 11:42:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:42:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:42:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:42:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-04 11:42:56,608 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-04 11:42:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:56,608 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-04 11:42:56,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:42:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-04 11:42:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:42:56,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:56,609 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-04 11:42:56,610 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:56,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-04 11:42:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:42:56,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:56,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:56,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:56,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,981 INFO 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-04 11:42:56,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:56,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:57,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:57,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:57,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:42:57,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:42:57,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:57,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:42:57,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:57,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:42:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:42:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:42:57,446 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-04 11:42:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:57,573 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-04 11:42:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:42:57,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-04 11:42:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:57,574 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:42:57,575 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:42:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:42:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:42:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:42:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:42:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-04 11:42:57,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-04 11:42:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:57,580 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-04 11:42:57,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:42:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-04 11:42:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:42:57,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:57,581 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-04 11:42:57,581 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:57,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-04 11:42:57,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:42:57,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:57,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:57,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:57,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:57,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:57,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 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-04 11:42:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:57,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:57,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:42:57,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:42:58,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:58,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:42:58,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:58,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:42:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:42:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:58,310 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-04 11:42:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:58,503 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-04 11:42:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:42:58,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-04 11:42:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:58,505 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:42:58,505 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:42:58,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:42:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:42:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:42:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-04 11:42:58,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-04 11:42:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:58,511 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-04 11:42:58,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:42:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-04 11:42:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:42:58,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:58,513 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-04 11:42:58,513 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:58,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-04 11:42:58,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:42:58,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:58,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:58,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:58,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:42:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:58,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:58,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:42:58,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:58,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:42:58,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:42:59,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-04 11:42:59,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:59,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:42:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:42:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:42:59,310 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-04 11:42:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:59,370 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-04 11:42:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:42:59,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-04 11:42:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:59,372 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:42:59,372 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:42:59,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:42:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:42:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:42:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:42:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-04 11:42:59,378 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-04 11:42:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:59,378 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-04 11:42:59,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:42:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-04 11:42:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:42:59,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:59,380 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-04 11:42:59,380 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:59,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-04 11:42:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:59,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:59,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:42:59,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:59,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:59,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:59,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:59,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:59,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 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-04 11:42:59,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:59,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:59,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:59,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:59,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:42:59,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:43:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:43:00,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:43:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:43:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:00,279 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-04 11:43:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:00,401 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-04 11:43:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:43:00,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-04 11:43:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:00,403 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:43:00,403 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:43:00,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:43:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:43:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:43:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-04 11:43:00,409 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-04 11:43:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:00,409 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-04 11:43:00,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:43:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-04 11:43:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:43:00,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,410 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-04 11:43:00,410 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-04 11:43:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:00,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:00,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:00,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:00,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,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 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-04 11:43:00,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:00,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:01,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:43:01,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:43:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:43:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:01,611 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-04 11:43:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,669 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-04 11:43:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:43:01,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-04 11:43:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,670 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:43:01,670 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:43:01,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:43:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:43:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:43:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-04 11:43:01,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-04 11:43:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,677 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-04 11:43:01,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:43:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-04 11:43:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:43:01,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,678 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-04 11:43:01,678 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-04 11:43:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:02,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:02,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:02,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:02,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,175 INFO 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-04 11:43:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:02,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:02,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:43:02,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:02,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:02,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:03,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:03,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:43:03,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:03,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:43:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:43:03,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:03,104 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-04 11:43:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:03,175 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-04 11:43:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:43:03,175 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-04 11:43:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:03,176 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:43:03,176 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:43:03,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:43:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:43:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:43:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-04 11:43:03,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-04 11:43:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:03,182 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-04 11:43:03,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:43:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-04 11:43:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:43:03,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:03,183 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-04 11:43:03,183 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:03,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-04 11:43:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:03,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:03,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:03,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:03,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,706 INFO 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-04 11:43:03,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:03,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:03,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:03,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:03,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:03,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:04,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:04,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:43:04,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:04,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:43:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:43:04,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:04,331 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-04 11:43:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:04,540 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-04 11:43:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:43:04,543 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-04 11:43:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:04,544 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:43:04,544 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:43:04,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:43:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:43:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:43:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-04 11:43:04,549 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-04 11:43:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:04,549 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-04 11:43:04,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:43:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-04 11:43:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:43:04,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:04,550 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-04 11:43:04,551 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:04,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-04 11:43:04,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:04,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:04,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:04,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:04,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:05,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:05,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:43:05,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:05,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:43:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:43:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:05,693 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-04 11:43:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,781 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-04 11:43:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:43:05,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-04 11:43:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,783 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:43:05,783 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:43:05,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:43:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:43:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:43:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-04 11:43:05,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-04 11:43:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,789 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-04 11:43:05,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:43:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-04 11:43:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:43:05,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,790 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-04 11:43:05,790 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:05,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-04 11:43:05,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:06,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:06,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:06,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:06,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:06,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:06,144 INFO 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-04 11:43:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:06,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:06,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:43:06,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:06,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:06,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:43:06,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:06,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:06,774 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-04 11:43:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:06,849 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-04 11:43:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:43:06,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 11:43:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:06,850 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:43:06,850 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:43:06,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:43:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:43:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:43:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-04 11:43:06,856 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-04 11:43:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:06,856 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-04 11:43:06,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-04 11:43:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:43:06,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:06,858 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-04 11:43:06,858 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-04 11:43:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:07,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:07,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:07,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:07,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,727 INFO 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-04 11:43:07,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:07,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:07,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:07,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:07,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:07,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:08,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:43:08,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:43:08,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:43:08,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:08,500 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-04 11:43:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:08,587 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-04 11:43:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:43:08,590 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-04 11:43:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:08,590 INFO L225 Difference]: With dead ends: 73 [2018-12-04 11:43:08,590 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:43:08,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:43:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:43:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:43:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-04 11:43:08,595 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-04 11:43:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-04 11:43:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:43:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-04 11:43:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:43:08,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,596 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-04 11:43:08,596 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-04 11:43:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:08,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:08,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:08,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:08,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,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 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-04 11:43:08,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:08,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:09,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:43:09,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:09,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:43:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:43:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:09,690 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-04 11:43:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:09,819 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-04 11:43:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:43:09,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-04 11:43:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:09,822 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:43:09,822 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:43:09,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:43:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:43:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:43:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-04 11:43:09,827 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-04 11:43:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:09,827 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-04 11:43:09,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:43:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-04 11:43:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:43:09,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:09,828 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-04 11:43:09,828 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:09,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-04 11:43:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:10,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:10,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:10,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:10,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:10,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:10,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:10,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:10,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:43:10,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:10,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:10,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:11,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-04 11:43:11,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:43:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:43:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:11,406 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-04 11:43:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:11,488 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-04 11:43:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:43:11,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-04 11:43:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:11,489 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:43:11,489 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:43:11,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:43:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:43:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:43:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-04 11:43:11,494 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-04 11:43:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:11,494 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-04 11:43:11,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:43:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-04 11:43:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:43:11,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:11,495 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-04 11:43:11,495 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:11,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-04 11:43:11,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:12,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:12,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,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 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-04 11:43:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:12,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:12,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:12,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:12,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:12,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:13,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:13,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:43:13,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:13,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:43:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:43:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:13,283 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-04 11:43:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:13,402 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-04 11:43:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:43:13,403 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-04 11:43:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:13,403 INFO L225 Difference]: With dead ends: 82 [2018-12-04 11:43:13,403 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:43:13,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:43:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:43:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:43:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-04 11:43:13,408 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-04 11:43:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:13,408 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-04 11:43:13,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:43:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-04 11:43:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:43:13,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:13,409 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-04 11:43:13,409 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:13,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-04 11:43:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:13,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:13,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:13,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:13,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:13,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:13,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,935 INFO 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-04 11:43:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:13,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:13,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:13,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:15,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:15,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:43:15,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:15,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:43:15,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:43:15,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:15,239 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-04 11:43:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:15,328 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-04 11:43:15,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:43:15,328 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-04 11:43:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:15,329 INFO L225 Difference]: With dead ends: 85 [2018-12-04 11:43:15,329 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:43:15,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 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-04 11:43:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:43:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:43:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:43:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-04 11:43:15,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-04 11:43:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:15,334 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-04 11:43:15,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:43:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-04 11:43:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:43:15,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:15,335 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-04 11:43:15,335 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:15,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-04 11:43:15,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:16,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:16,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:16,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:16,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:16,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:16,055 INFO 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-04 11:43:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:16,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:16,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:43:16,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:16,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:16,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:17,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-04 11:43:17,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:17,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:17,062 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-04 11:43:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:17,189 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-04 11:43:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:43:17,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-04 11:43:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:17,189 INFO L225 Difference]: With dead ends: 88 [2018-12-04 11:43:17,189 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:43:17,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:43:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:43:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:43:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-04 11:43:17,194 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-04 11:43:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:17,195 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-04 11:43:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-04 11:43:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:43:17,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:17,196 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-04 11:43:17,196 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:17,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-04 11:43:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:17,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:17,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:17,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:17,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:17,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:17,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,940 INFO 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-04 11:43:17,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:17,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:17,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:17,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:17,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:18,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:19,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:19,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:43:19,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:19,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:43:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:43:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:19,140 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-04 11:43:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:19,266 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-04 11:43:19,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:43:19,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-04 11:43:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:19,267 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:43:19,267 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:43:19,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:43:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:43:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:43:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-04 11:43:19,272 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-04 11:43:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:19,272 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-04 11:43:19,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:43:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-04 11:43:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:43:19,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:19,273 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-04 11:43:19,273 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:19,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-04 11:43:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:19,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:19,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:19,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:19,688 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:19,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:19,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:19,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:19,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:19,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:20,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:43:20,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:20,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:43:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:43:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:20,954 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-04 11:43:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:21,076 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-04 11:43:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:43:21,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-04 11:43:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:21,078 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:43:21,078 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:43:21,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:43:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:43:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:43:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-04 11:43:21,082 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-04 11:43:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:21,082 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-04 11:43:21,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:43:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-04 11:43:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:43:21,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:21,083 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-04 11:43:21,083 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:21,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-04 11:43:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:21,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:21,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:21,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:21,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:21,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:21,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:21,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:21,521 INFO 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-04 11:43:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:21,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:21,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:43:21,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:21,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:21,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:23,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-04 11:43:23,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:43:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:43:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:23,308 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-04 11:43:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:23,409 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-04 11:43:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:43:23,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-04 11:43:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:23,410 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:43:23,410 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:43:23,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:43:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:43:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:43:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-04 11:43:23,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-04 11:43:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:23,415 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-04 11:43:23,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:43:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-04 11:43:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:43:23,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:23,415 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-04 11:43:23,415 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:23,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-04 11:43:23,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:24,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:24,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:24,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:24,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,397 INFO 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-04 11:43:24,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:24,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:24,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:24,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:24,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:24,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:25,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:25,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:43:25,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:25,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:43:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:43:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:25,521 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-04 11:43:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:25,682 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-04 11:43:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:43:25,683 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-04 11:43:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:25,684 INFO L225 Difference]: With dead ends: 100 [2018-12-04 11:43:25,684 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:43:25,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:43:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:43:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:43:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-04 11:43:25,687 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-04 11:43:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:25,688 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-04 11:43:25,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:43:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-04 11:43:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:43:25,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:25,689 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-04 11:43:25,689 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:25,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-04 11:43:25,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:25,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:25,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:26,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:26,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:26,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:26,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,201 INFO 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-04 11:43:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:26,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:26,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:26,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:27,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:27,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:43:27,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:27,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:43:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:43:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:27,480 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-04 11:43:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:27,672 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-04 11:43:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:43:27,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-04 11:43:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:27,672 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:43:27,673 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:43:27,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:43:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:43:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:43:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-04 11:43:27,677 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-04 11:43:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:27,677 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-04 11:43:27,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:43:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-04 11:43:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:43:27,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:27,678 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-04 11:43:27,678 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-04 11:43:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:27,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:27,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:28,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:28,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:28,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:28,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:28,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:28,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:28,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:43:28,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:28,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:28,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:43:29,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:29,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:43:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:43:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:43:29,690 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-04 11:43:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:29,832 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-04 11:43:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:43:29,832 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-04 11:43:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:29,833 INFO L225 Difference]: With dead ends: 106 [2018-12-04 11:43:29,833 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:43:29,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:43:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:43:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:43:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:43:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-04 11:43:29,837 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-04 11:43:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:29,837 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-04 11:43:29,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:43:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-04 11:43:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:43:29,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:29,838 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-04 11:43:29,838 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:29,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-04 11:43:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:30,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:30,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:30,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:30,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,354 INFO 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-04 11:43:30,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:30,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:30,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:30,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:30,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:30,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:31,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:31,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:43:31,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:31,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:43:31,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:43:31,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:31,706 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-04 11:43:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:31,907 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-04 11:43:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:43:31,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-04 11:43:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:31,908 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:43:31,908 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:43:31,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:43:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:43:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:43:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-04 11:43:31,911 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-04 11:43:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:31,911 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-04 11:43:31,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:43:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-04 11:43:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:43:31,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:31,912 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-04 11:43:31,912 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:31,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-04 11:43:31,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:31,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:32,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:32,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:32,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:32,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,860 INFO 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-04 11:43:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:32,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:32,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:32,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:34,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:34,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:43:34,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:34,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:43:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:43:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:34,640 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-04 11:43:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:34,899 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-04 11:43:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:43:34,899 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-04 11:43:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:34,900 INFO L225 Difference]: With dead ends: 112 [2018-12-04 11:43:34,900 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:43:34,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:43:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:43:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:43:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-04 11:43:34,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-04 11:43:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:34,904 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-04 11:43:34,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:43:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-04 11:43:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:43:34,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:34,905 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-04 11:43:34,905 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:34,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-04 11:43:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:35,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:35,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:35,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:35,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:35,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:35,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:35,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:35,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:35,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:43:35,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:35,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:35,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:37,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:37,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:43:37,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:43:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:43:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:37,313 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-04 11:43:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:37,451 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-04 11:43:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:43:37,451 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-04 11:43:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:37,452 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:43:37,452 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:43:37,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:43:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:43:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:43:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-04 11:43:37,455 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-04 11:43:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:37,455 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-04 11:43:37,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:43:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-04 11:43:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:43:37,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:37,455 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-04 11:43:37,456 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:37,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-04 11:43:37,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:37,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:37,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:38,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:38,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:38,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:38,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:38,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:38,230 INFO 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-04 11:43:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:38,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:38,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:38,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:38,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:38,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:43:39,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:39,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:43:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:43:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:43:39,952 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-04 11:43:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:40,093 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-04 11:43:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:43:40,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-04 11:43:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:40,095 INFO L225 Difference]: With dead ends: 118 [2018-12-04 11:43:40,095 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:43:40,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:43:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:43:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:43:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:43:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-04 11:43:40,098 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-04 11:43:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:40,098 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-04 11:43:40,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:43:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-04 11:43:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:43:40,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:40,099 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-04 11:43:40,100 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:40,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-04 11:43:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:40,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:40,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:40,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:40,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:40,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:40,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:40,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:40,750 INFO 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-04 11:43:40,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:40,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:40,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:40,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:42,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:42,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:43:42,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:42,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:43:42,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:43:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:42,423 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-04 11:43:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:42,575 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-04 11:43:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:43:42,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-04 11:43:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:42,576 INFO L225 Difference]: With dead ends: 121 [2018-12-04 11:43:42,576 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:43:42,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:43:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:43:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:43:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-04 11:43:42,579 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-04 11:43:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:42,580 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-04 11:43:42,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:43:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-04 11:43:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:43:42,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:42,580 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-04 11:43:42,581 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:42,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-04 11:43:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:43,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:43,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:43,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:43,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:43,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:43,429 INFO 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-04 11:43:43,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:43,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:43,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:43:43,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:43,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:43,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:45,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:45,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:43:45,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:45,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:43:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:43:45,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:45,993 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-04 11:43:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:46,141 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-04 11:43:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:43:46,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-04 11:43:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:46,142 INFO L225 Difference]: With dead ends: 124 [2018-12-04 11:43:46,142 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:43:46,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:43:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:43:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:43:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-04 11:43:46,146 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-04 11:43:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-04 11:43:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:43:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-04 11:43:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:43:46,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:46,148 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-04 11:43:46,148 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:46,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-04 11:43:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:46,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:46,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:46,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:46,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:46,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:46,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:46,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:46,864 INFO 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-04 11:43:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:46,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:46,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:46,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:46,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:46,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:48,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:48,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:43:48,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:48,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:43:48,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:43:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:48,882 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-04 11:43:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:49,032 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-04 11:43:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:43:49,033 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-04 11:43:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:49,034 INFO L225 Difference]: With dead ends: 127 [2018-12-04 11:43:49,034 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:43:49,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:43:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:43:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:43:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-04 11:43:49,038 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-04 11:43:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:49,038 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-04 11:43:49,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:43:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-04 11:43:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:43:49,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:49,039 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-04 11:43:49,039 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:49,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-04 11:43:49,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:49,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:49,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:49,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:49,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:49,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:49,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:49,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:49,868 INFO 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-04 11:43:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:49,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:49,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:49,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:52,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:52,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:43:52,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:52,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:43:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:43:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:43:52,043 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-04 11:43:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:52,208 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-04 11:43:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:43:52,209 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-04 11:43:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:52,210 INFO L225 Difference]: With dead ends: 130 [2018-12-04 11:43:52,210 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:43:52,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 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-04 11:43:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:43:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:43:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:43:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-04 11:43:52,214 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-04 11:43:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:52,214 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-04 11:43:52,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:43:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-04 11:43:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:43:52,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:52,215 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-04 11:43:52,216 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:52,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-04 11:43:52,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:52,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:52,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:52,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:52,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:43:53,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:53,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:53,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:53,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:53,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:53,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 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-04 11:43:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:53,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:53,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:43:53,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:53,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:43:53,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:43:55,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:55,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:43:55,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:55,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:43:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:43:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:55,425 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-04 11:43:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:55,597 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-04 11:43:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:43:55,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-04 11:43:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:55,599 INFO L225 Difference]: With dead ends: 133 [2018-12-04 11:43:55,599 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:43:55,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:43:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:43:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:43:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-04 11:43:55,602 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-04 11:43:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:55,603 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-04 11:43:55,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:43:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-04 11:43:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:43:55,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:55,603 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-04 11:43:55,604 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:55,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-04 11:43:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:43:56,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:56,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:56,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:56,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:56,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:56,437 INFO 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-04 11:43:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:56,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:56,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:56,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:56,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:43:56,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:43:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:43:58,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:43:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:43:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:43:58,958 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-04 11:43:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:59,116 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-04 11:43:59,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:43:59,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-04 11:43:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:59,117 INFO L225 Difference]: With dead ends: 136 [2018-12-04 11:43:59,117 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:43:59,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:43:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:43:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:43:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:43:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-04 11:43:59,121 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-04 11:43:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:59,121 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-04 11:43:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:43:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-04 11:43:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:43:59,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:59,122 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-04 11:43:59,122 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-04 11:43:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:59,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:59,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:01,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:01,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:01,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:01,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:01,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:44:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:01,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:01,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:01,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:03,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:44:03,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:03,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:44:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:44:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:44:03,469 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-04 11:44:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:03,770 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-04 11:44:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:44:03,771 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-04 11:44:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:03,772 INFO L225 Difference]: With dead ends: 139 [2018-12-04 11:44:03,772 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:44:03,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:44:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:44:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:44:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:44:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-04 11:44:03,776 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-04 11:44:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:03,776 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-04 11:44:03,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:44:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-04 11:44:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:44:03,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:03,777 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-04 11:44:03,777 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:03,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-04 11:44:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:03,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:03,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:04,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:04,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:04,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:04,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:04,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:04,822 INFO 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-04 11:44:04,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:04,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:05,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:44:05,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:05,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:05,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:07,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:07,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-04 11:44:07,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:07,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:44:07,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:44:07,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:07,508 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-04 11:44:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:08,925 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-04 11:44:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:44:08,925 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-04 11:44:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:08,926 INFO L225 Difference]: With dead ends: 142 [2018-12-04 11:44:08,926 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:44:08,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:44:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:44:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:44:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-04 11:44:08,930 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-04 11:44:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-04 11:44:08,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:44:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-04 11:44:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:44:08,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:08,931 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-04 11:44:08,931 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:08,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-04 11:44:08,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:08,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:08,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:10,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:10,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:10,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:10,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:10,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:10,125 INFO 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-04 11:44:10,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:10,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:10,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:10,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:10,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:10,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:44:13,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:13,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:44:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:44:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:13,845 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-04 11:44:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:14,124 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-04 11:44:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:44:14,125 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-04 11:44:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:14,126 INFO L225 Difference]: With dead ends: 145 [2018-12-04 11:44:14,126 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:44:14,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:44:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:44:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:44:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-04 11:44:14,131 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-04 11:44:14,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:14,131 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-04 11:44:14,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:44:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-04 11:44:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:44:14,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:14,133 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-04 11:44:14,133 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:14,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-04 11:44:14,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:14,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:14,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:15,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:15,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:15,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:15,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:15,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:15,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:44:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:15,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:15,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:15,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:18,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:18,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:44:18,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:18,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:44:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:44:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:18,099 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-04 11:44:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:18,273 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-04 11:44:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:44:18,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-04 11:44:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:18,275 INFO L225 Difference]: With dead ends: 148 [2018-12-04 11:44:18,275 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:44:18,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:44:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:44:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:44:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-04 11:44:18,280 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-04 11:44:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:18,280 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-04 11:44:18,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:44:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-04 11:44:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:44:18,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:18,281 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-04 11:44:18,281 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:18,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-04 11:44:18,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:18,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:18,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:20,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:20,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:20,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:20,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:44:20,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:20,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:20,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:44:20,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:20,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:20,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:23,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:23,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:44:23,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:23,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:44:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:44:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:23,206 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-04 11:44:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:23,392 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-04 11:44:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:44:23,393 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-04 11:44:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:23,393 INFO L225 Difference]: With dead ends: 151 [2018-12-04 11:44:23,393 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:44:23,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:44:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:44:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:44:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-04 11:44:23,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-04 11:44:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:23,397 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-04 11:44:23,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:44:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-04 11:44:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:44:23,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:23,398 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-04 11:44:23,398 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-04 11:44:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:23,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:23,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:24,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:24,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:24,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:24,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:24,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:24,949 INFO 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-04 11:44:24,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:24,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:25,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:25,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:25,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:25,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:27,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:44:27,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:27,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:44:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:44:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:27,632 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-04 11:44:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:27,900 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-04 11:44:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:44:27,900 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-04 11:44:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:27,901 INFO L225 Difference]: With dead ends: 154 [2018-12-04 11:44:27,901 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:44:27,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:44:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:44:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:44:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-04 11:44:27,905 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-04 11:44:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:27,906 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-04 11:44:27,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:44:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-04 11:44:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:44:27,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:27,907 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-04 11:44:27,907 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:27,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-04 11:44:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:27,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:27,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:29,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:29,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:29,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:29,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:29,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:29,336 INFO 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-04 11:44:29,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:29,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:29,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:29,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:32,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:32,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:44:32,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:32,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:44:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:44:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:32,260 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-04 11:44:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:32,488 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-04 11:44:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:44:32,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-04 11:44:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:32,489 INFO L225 Difference]: With dead ends: 157 [2018-12-04 11:44:32,489 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:44:32,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:44:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:44:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:44:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-04 11:44:32,493 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-04 11:44:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:32,493 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-04 11:44:32,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:44:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-04 11:44:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:44:32,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:32,494 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-04 11:44:32,494 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:32,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-04 11:44:32,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:32,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:32,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:34,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:34,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:34,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:34,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:34,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:34,255 INFO 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-04 11:44:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:34,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:35,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:44:35,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:35,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:35,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:44:38,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:38,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:44:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:44:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:38,736 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-04 11:44:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:39,443 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-04 11:44:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:44:39,444 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-04 11:44:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:39,444 INFO L225 Difference]: With dead ends: 160 [2018-12-04 11:44:39,445 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:44:39,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:44:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:44:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:44:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-04 11:44:39,449 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-04 11:44:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:39,449 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-04 11:44:39,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:44:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-04 11:44:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:44:39,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:39,450 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-04 11:44:39,450 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:39,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-04 11:44:39,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:39,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:39,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:40,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:40,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:40,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:40,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:40,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:40,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:44:40,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:40,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:40,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:40,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:40,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:40,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:44:43,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:43,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:44:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:44:43,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:43,510 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-04 11:44:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:43,760 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-04 11:44:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:44:43,760 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-04 11:44:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:43,761 INFO L225 Difference]: With dead ends: 163 [2018-12-04 11:44:43,761 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:44:43,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:44:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:44:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:44:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-04 11:44:43,765 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-04 11:44:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:43,766 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-04 11:44:43,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:44:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-04 11:44:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:44:43,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:43,767 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-04 11:44:43,767 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:43,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-04 11:44:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:43,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:43,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:45,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:45,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:45,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:45,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:45,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:45,210 INFO 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-04 11:44:45,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:45,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:45,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:45,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:48,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:48,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:44:48,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:48,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:44:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:44:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:48,471 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-04 11:44:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:48,692 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-04 11:44:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:44:48,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-04 11:44:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:48,694 INFO L225 Difference]: With dead ends: 166 [2018-12-04 11:44:48,694 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:44:48,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:44:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:44:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:44:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-04 11:44:48,697 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-04 11:44:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:48,697 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-04 11:44:48,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:44:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-04 11:44:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:44:48,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:48,698 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-04 11:44:48,698 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:48,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-04 11:44:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:48,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:44:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:49,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:49,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:49,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:49,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:49,904 INFO 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-04 11:44:49,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:49,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:51,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:44:51,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:51,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:44:51,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:44:54,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:54,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-04 11:44:54,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:54,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-04 11:44:54,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-04 11:44:54,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:54,367 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-04 11:44:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:54,694 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-04 11:44:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 11:44:54,695 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-04 11:44:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:54,696 INFO L225 Difference]: With dead ends: 169 [2018-12-04 11:44:54,696 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 11:44:54,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 11:44:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-04 11:44:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-04 11:44:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-04 11:44:54,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-04 11:44:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:54,700 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-04 11:44:54,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-04 11:44:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-04 11:44:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-04 11:44:54,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:54,700 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-04 11:44:54,701 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:54,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-04 11:44:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:54,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:54,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:44:56,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:56,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:56,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:56,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:56,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:56,002 INFO 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-04 11:44:56,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:56,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:56,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:56,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:56,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:44:56,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:44:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:59,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-04 11:44:59,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:59,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:44:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:44:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:44:59,319 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-04 11:44:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:59,574 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-04 11:44:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 11:44:59,574 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-04 11:44:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:59,575 INFO L225 Difference]: With dead ends: 172 [2018-12-04 11:44:59,575 INFO L226 Difference]: Without dead ends: 115 [2018-12-04 11:44:59,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:44:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-04 11:44:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-04 11:44:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-04 11:44:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-04 11:44:59,580 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-04 11:44:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:59,580 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-04 11:44:59,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:44:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-04 11:44:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-04 11:44:59,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:59,581 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-04 11:44:59,581 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:59,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-04 11:44:59,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:59,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:59,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:45:01,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:01,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:01,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:01,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:01,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:01,172 INFO 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-04 11:45:01,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:01,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:01,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:45:01,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:45:05,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:05,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-04 11:45:05,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:05,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-04 11:45:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-04 11:45:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:45:05,010 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-04 11:45:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:05,428 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-04 11:45:05,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 11:45:05,428 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-04 11:45:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:05,429 INFO L225 Difference]: With dead ends: 175 [2018-12-04 11:45:05,429 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 11:45:05,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:45:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 11:45:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-04 11:45:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-04 11:45:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-04 11:45:05,434 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-04 11:45:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:05,434 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-04 11:45:05,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-04 11:45:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-04 11:45:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-04 11:45:05,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:05,435 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-04 11:45:05,435 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:05,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-04 11:45:05,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:05,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:05,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:45:06,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:06,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:06,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:06,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,652 INFO 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-04 11:45:06,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:06,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:07,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 11:45:07,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:07,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:45:07,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:45:11,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:11,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-04 11:45:11,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:11,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:45:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:45:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:45:11,362 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-04 11:45:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:11,675 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-04 11:45:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:45:11,675 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-04 11:45:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:11,676 INFO L225 Difference]: With dead ends: 178 [2018-12-04 11:45:11,676 INFO L226 Difference]: Without dead ends: 119 [2018-12-04 11:45:11,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:45:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-04 11:45:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-04 11:45:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-04 11:45:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-04 11:45:11,680 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-04 11:45:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:11,680 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-04 11:45:11,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:45:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-04 11:45:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-04 11:45:11,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:11,681 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-04 11:45:11,682 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:11,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-04 11:45:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:11,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:11,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:45:13,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:13,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:13,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:13,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:13,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:13,022 INFO 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-04 11:45:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:13,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:13,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:13,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:13,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:45:13,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:45:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-04 11:45:16,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:16,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-04 11:45:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-04 11:45:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:45:16,796 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-04 11:45:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:17,073 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-04 11:45:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 11:45:17,074 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-04 11:45:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:17,074 INFO L225 Difference]: With dead ends: 181 [2018-12-04 11:45:17,074 INFO L226 Difference]: Without dead ends: 121 [2018-12-04 11:45:17,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:45:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-04 11:45:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-04 11:45:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-04 11:45:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-04 11:45:17,077 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-04 11:45:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:17,078 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-04 11:45:17,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-04 11:45:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-04 11:45:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-04 11:45:17,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:17,078 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-04 11:45:17,079 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:17,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-04 11:45:17,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:17,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:17,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:17,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:45:18,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:18,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:18,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:18,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:18,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:18,379 INFO 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-04 11:45:18,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:18,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:18,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:45:18,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:45:22,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:22,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-04 11:45:22,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:22,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-04 11:45:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-04 11:45:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:45:22,238 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-04 11:45:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:22,575 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-04 11:45:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 11:45:22,576 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-04 11:45:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:22,576 INFO L225 Difference]: With dead ends: 184 [2018-12-04 11:45:22,576 INFO L226 Difference]: Without dead ends: 123 [2018-12-04 11:45:22,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:45:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-04 11:45:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-04 11:45:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-04 11:45:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-04 11:45:22,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-04 11:45:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:22,581 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-04 11:45:22,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-04 11:45:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-04 11:45:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-04 11:45:22,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:22,582 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-04 11:45:22,582 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:22,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-04 11:45:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:22,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:45:23,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:23,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:23,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:23,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:23,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:23,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 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-04 11:45:23,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:23,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:25,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-04 11:45:25,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:25,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:45:25,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:45:29,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:29,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-04 11:45:29,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:29,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-04 11:45:29,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-04 11:45:29,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:45:29,088 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-04 11:45:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:29,407 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-04 11:45:29,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:45:29,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-04 11:45:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:29,408 INFO L225 Difference]: With dead ends: 187 [2018-12-04 11:45:29,408 INFO L226 Difference]: Without dead ends: 125 [2018-12-04 11:45:29,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:45:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-04 11:45:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-04 11:45:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-04 11:45:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-04 11:45:29,412 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-04 11:45:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:29,413 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-04 11:45:29,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-04 11:45:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-04 11:45:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-04 11:45:29,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:29,414 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-04 11:45:29,414 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:29,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-04 11:45:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:29,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:29,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 11:45:30,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:30,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:30,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:30,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:30,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:30,894 INFO 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-04 11:45:30,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:30,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:30,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:30,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:30,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 11:45:31,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 11:45:34,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:34,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-04 11:45:34,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-04 11:45:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-04 11:45:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:45:34,955 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-04 11:45:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:35,208 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-04 11:45:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 11:45:35,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-04 11:45:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:35,209 INFO L225 Difference]: With dead ends: 190 [2018-12-04 11:45:35,210 INFO L226 Difference]: Without dead ends: 127 [2018-12-04 11:45:35,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:45:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-04 11:45:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-04 11:45:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-04 11:45:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-04 11:45:35,213 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-04 11:45:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:35,213 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-04 11:45:35,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-04 11:45:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-04 11:45:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-04 11:45:35,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:35,214 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-04 11:45:35,214 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:35,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-04 11:45:35,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:35,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:35,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:35,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:35,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 11:45:36,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:36,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:36,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:36,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:36,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:36,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 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-04 11:45:36,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:36,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:36,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 11:45:36,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 11:45:40,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:40,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-04 11:45:40,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:40,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-04 11:45:40,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-04 11:45:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:40,791 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-04 11:45:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:41,137 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-04 11:45:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 11:45:41,137 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-04 11:45:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:41,138 INFO L225 Difference]: With dead ends: 193 [2018-12-04 11:45:41,138 INFO L226 Difference]: Without dead ends: 129 [2018-12-04 11:45:41,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-04 11:45:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-04 11:45:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-04 11:45:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-04 11:45:41,143 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-04 11:45:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:41,143 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-04 11:45:41,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-04 11:45:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-04 11:45:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-04 11:45:41,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:41,144 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-04 11:45:41,144 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:41,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-04 11:45:41,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:41,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 11:45:42,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:42,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:42,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:42,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:42,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:42,622 INFO 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-04 11:45:42,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:42,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:43,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 11:45:43,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:43,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 11:45:43,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 11:45:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:47,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-04 11:45:47,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:47,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:45:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:45:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 11:45:47,947 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-04 11:45:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:48,323 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-04 11:45:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 11:45:48,323 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-04 11:45:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:48,324 INFO L225 Difference]: With dead ends: 196 [2018-12-04 11:45:48,324 INFO L226 Difference]: Without dead ends: 131 [2018-12-04 11:45:48,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 11:45:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-04 11:45:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-04 11:45:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-04 11:45:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-04 11:45:48,328 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-04 11:45:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:48,328 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-04 11:45:48,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:45:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-04 11:45:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-04 11:45:48,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:48,330 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-04 11:45:48,330 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:48,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-04 11:45:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:48,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:48,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 11:45:49,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:49,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:49,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:49,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:49,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:49,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:45:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:49,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:49,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:49,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:49,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 11:45:49,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 11:45:54,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:54,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-04 11:45:54,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:54,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-04 11:45:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-04 11:45:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:45:54,259 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-04 11:45:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:54,637 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-04 11:45:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-04 11:45:54,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-04 11:45:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:54,638 INFO L225 Difference]: With dead ends: 199 [2018-12-04 11:45:54,638 INFO L226 Difference]: Without dead ends: 133 [2018-12-04 11:45:54,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:45:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-04 11:45:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-04 11:45:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-04 11:45:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-04 11:45:54,642 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-04 11:45:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:54,643 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-04 11:45:54,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-04 11:45:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-04 11:45:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-04 11:45:54,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:54,644 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-04 11:45:54,644 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:54,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-04 11:45:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:54,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:54,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 11:45:56,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:56,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:56,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:56,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:56,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:56,304 INFO 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-04 11:45:56,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:56,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:56,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 11:45:56,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 11:46:00,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:00,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-04 11:46:00,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:00,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-04 11:46:00,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-04 11:46:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 11:46:00,839 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-04 11:46:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:01,282 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-04 11:46:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 11:46:01,282 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-04 11:46:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:01,283 INFO L225 Difference]: With dead ends: 202 [2018-12-04 11:46:01,283 INFO L226 Difference]: Without dead ends: 135 [2018-12-04 11:46:01,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 11:46:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-04 11:46:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-04 11:46:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-04 11:46:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-04 11:46:01,288 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-04 11:46:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:01,288 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-04 11:46:01,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-04 11:46:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-04 11:46:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-04 11:46:01,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:01,289 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-04 11:46:01,289 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:01,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-04 11:46:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:01,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:01,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:01,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:01,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 11:46:02,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:02,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:02,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:02,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:02,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:02,881 INFO 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-04 11:46:02,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:02,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:06,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 11:46:06,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:06,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 11:46:06,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 11:46:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-04 11:46:12,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:12,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-04 11:46:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-04 11:46:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:46:12,158 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-04 11:46:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:12,514 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-04 11:46:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 11:46:12,514 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-04 11:46:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:12,515 INFO L225 Difference]: With dead ends: 205 [2018-12-04 11:46:12,515 INFO L226 Difference]: Without dead ends: 137 [2018-12-04 11:46:12,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:46:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-04 11:46:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-04 11:46:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-04 11:46:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-04 11:46:12,519 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-04 11:46:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:12,519 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-04 11:46:12,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-04 11:46:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-04 11:46:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-04 11:46:12,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:12,520 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-04 11:46:12,520 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:12,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:12,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-04 11:46:12,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:12,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:12,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 11:46:14,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:14,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:14,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:14,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:14,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:14,208 INFO 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-04 11:46:14,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:14,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:14,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:14,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:14,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 11:46:14,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 11:46:19,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:19,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-04 11:46:19,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:19,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-04 11:46:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-04 11:46:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 11:46:19,219 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-04 11:46:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:19,650 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-04 11:46:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 11:46:19,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-04 11:46:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:19,651 INFO L225 Difference]: With dead ends: 208 [2018-12-04 11:46:19,651 INFO L226 Difference]: Without dead ends: 139 [2018-12-04 11:46:19,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 11:46:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-04 11:46:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-04 11:46:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-04 11:46:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-04 11:46:19,655 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-04 11:46:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:19,656 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-04 11:46:19,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-04 11:46:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-04 11:46:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-04 11:46:19,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:19,657 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-04 11:46:19,657 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:19,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-04 11:46:19,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:19,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:19,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 11:46:21,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:21,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:21,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:21,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:21,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:21,393 INFO 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-04 11:46:21,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:21,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:21,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 11:46:21,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 11:46:26,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:26,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-04 11:46:26,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:26,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-04 11:46:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-04 11:46:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 11:46:26,346 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-04 11:46:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:26,814 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-04 11:46:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-04 11:46:26,814 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-04 11:46:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:26,815 INFO L225 Difference]: With dead ends: 211 [2018-12-04 11:46:26,815 INFO L226 Difference]: Without dead ends: 141 [2018-12-04 11:46:26,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 11:46:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-04 11:46:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-04 11:46:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-04 11:46:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-04 11:46:26,819 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-04 11:46:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:26,819 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-04 11:46:26,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-04 11:46:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-04 11:46:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-04 11:46:26,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:26,819 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-04 11:46:26,820 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:26,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-04 11:46:26,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:26,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 11:46:28,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:28,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:28,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:28,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:28,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:28,579 INFO 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-04 11:46:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:28,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:32,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-04 11:46:32,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:32,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 11:46:32,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 11:46:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-04 11:46:37,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:37,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:46:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:46:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 11:46:37,237 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-04 11:46:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:37,721 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-04 11:46:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-04 11:46:37,721 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-04 11:46:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:37,722 INFO L225 Difference]: With dead ends: 214 [2018-12-04 11:46:37,722 INFO L226 Difference]: Without dead ends: 143 [2018-12-04 11:46:37,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 11:46:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-04 11:46:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-04 11:46:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-04 11:46:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-04 11:46:37,725 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-04 11:46:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:37,725 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-04 11:46:37,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:46:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-04 11:46:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-04 11:46:37,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:37,726 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-04 11:46:37,726 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:37,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-04 11:46:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:37,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:37,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:37,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:37,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 11:46:39,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:39,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:39,464 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:39,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:39,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:39,464 INFO 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-04 11:46:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:39,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:39,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:39,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:39,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 11:46:39,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 11:46:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-04 11:46:44,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:44,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-04 11:46:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-04 11:46:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:46:44,691 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-04 11:46:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:45,170 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-04 11:46:45,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 11:46:45,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-04 11:46:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:45,172 INFO L225 Difference]: With dead ends: 217 [2018-12-04 11:46:45,172 INFO L226 Difference]: Without dead ends: 145 [2018-12-04 11:46:45,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:46:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-04 11:46:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-04 11:46:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-04 11:46:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-04 11:46:45,176 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-04 11:46:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:45,176 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-04 11:46:45,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-04 11:46:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-04 11:46:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-04 11:46:45,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:45,177 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-04 11:46:45,177 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:45,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-04 11:46:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:45,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:45,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 11:46:47,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:47,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:47,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:47,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:47,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:47,042 INFO 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-04 11:46:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:47,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:47,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 11:46:47,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 11:46:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-04 11:46:52,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:52,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-04 11:46:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-04 11:46:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 11:46:52,523 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-04 11:46:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:52,905 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-04 11:46:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-04 11:46:52,905 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-04 11:46:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:52,906 INFO L225 Difference]: With dead ends: 220 [2018-12-04 11:46:52,906 INFO L226 Difference]: Without dead ends: 147 [2018-12-04 11:46:52,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 11:46:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-04 11:46:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-04 11:46:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-04 11:46:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-04 11:46:52,910 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-04 11:46:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:52,910 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-04 11:46:52,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-04 11:46:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-04 11:46:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-04 11:46:52,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:52,911 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-04 11:46:52,912 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:52,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-04 11:46:52,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:52,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:52,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 11:46:54,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:54,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:54,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:54,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:54,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:54,792 INFO 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-04 11:46:54,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:54,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:57,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-04 11:46:57,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:57,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 11:46:57,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 11:47:03,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:03,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-04 11:47:03,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:03,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 11:47:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 11:47:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 11:47:03,245 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-04 11:47:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:03,779 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-04 11:47:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-04 11:47:03,780 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-04 11:47:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:03,780 INFO L225 Difference]: With dead ends: 223 [2018-12-04 11:47:03,781 INFO L226 Difference]: Without dead ends: 149 [2018-12-04 11:47:03,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 11:47:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-04 11:47:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-04 11:47:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-04 11:47:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-04 11:47:03,786 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-04 11:47:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-04 11:47:03,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 11:47:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-04 11:47:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-04 11:47:03,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:03,787 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-04 11:47:03,787 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:03,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-04 11:47:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:03,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:03,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 11:47:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:05,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:05,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:05,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:05,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:47:05,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:05,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:05,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:05,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:05,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 11:47:05,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 11:47:11,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:11,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-04 11:47:11,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:11,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 11:47:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 11:47:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 11:47:11,456 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-04 11:47:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:11,937 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-04 11:47:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 11:47:11,937 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-04 11:47:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:11,938 INFO L225 Difference]: With dead ends: 226 [2018-12-04 11:47:11,938 INFO L226 Difference]: Without dead ends: 151 [2018-12-04 11:47:11,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 11:47:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-04 11:47:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-04 11:47:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-04 11:47:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-04 11:47:11,942 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-04 11:47:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:11,942 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-04 11:47:11,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 11:47:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-04 11:47:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-04 11:47:11,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:11,944 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-04 11:47:11,944 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:11,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:11,944 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-04 11:47:11,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:11,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:11,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 11:47:13,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:13,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:13,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:13,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:13,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:13,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:47:14,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:14,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:14,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 11:47:14,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 11:47:19,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:19,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-04 11:47:19,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:19,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-04 11:47:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-04 11:47:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:47:19,851 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-04 11:47:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:20,333 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-04 11:47:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 11:47:20,334 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-04 11:47:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:20,334 INFO L225 Difference]: With dead ends: 229 [2018-12-04 11:47:20,334 INFO L226 Difference]: Without dead ends: 153 [2018-12-04 11:47:20,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:47:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-04 11:47:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-04 11:47:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-04 11:47:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-04 11:47:20,340 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-04 11:47:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:20,340 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-04 11:47:20,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-04 11:47:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-04 11:47:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-04 11:47:20,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:20,340 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-04 11:47:20,341 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:20,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-04 11:47:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:20,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:20,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:20,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 11:47:22,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:22,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:22,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:22,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:22,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:22,582 INFO 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-04 11:47:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:22,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:25,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 11:47:25,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:25,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 11:47:25,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 11:47:30,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:30,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-04 11:47:30,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:30,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:47:30,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:47:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 11:47:30,955 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-04 11:47:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:31,486 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-04 11:47:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-04 11:47:31,486 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-04 11:47:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:31,487 INFO L225 Difference]: With dead ends: 232 [2018-12-04 11:47:31,487 INFO L226 Difference]: Without dead ends: 155 [2018-12-04 11:47:31,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 11:47:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-04 11:47:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-04 11:47:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-04 11:47:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-04 11:47:31,491 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-04 11:47:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:31,491 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-04 11:47:31,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:47:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-04 11:47:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-04 11:47:31,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:31,492 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-04 11:47:31,492 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:31,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-04 11:47:31,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:31,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:31,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:31,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 11:47:33,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:33,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:33,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:33,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:33,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:33,624 INFO 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-04 11:47:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:33,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:33,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:33,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:33,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 11:47:33,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 11:47:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:39,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-04 11:47:39,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:39,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-04 11:47:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-04 11:47:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 11:47:39,785 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-04 11:47:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:40,430 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-04 11:47:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-04 11:47:40,430 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-04 11:47:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:40,431 INFO L225 Difference]: With dead ends: 235 [2018-12-04 11:47:40,431 INFO L226 Difference]: Without dead ends: 157 [2018-12-04 11:47:40,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 11:47:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-04 11:47:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-04 11:47:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-04 11:47:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-04 11:47:40,434 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-04 11:47:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:40,434 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-04 11:47:40,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-04 11:47:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-04 11:47:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-04 11:47:40,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:40,435 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-04 11:47:40,435 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:40,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-04 11:47:40,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 11:47:42,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:42,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:42,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:42,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,549 INFO 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-04 11:47:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:42,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:42,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 11:47:42,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 11:47:48,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:48,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-04 11:47:48,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:48,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-04 11:47:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-04 11:47:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 11:47:48,928 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-04 11:47:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:49,450 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-04 11:47:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-04 11:47:49,450 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-04 11:47:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:49,451 INFO L225 Difference]: With dead ends: 238 [2018-12-04 11:47:49,452 INFO L226 Difference]: Without dead ends: 159 [2018-12-04 11:47:49,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 11:47:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-04 11:47:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-04 11:47:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-04 11:47:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-04 11:47:49,457 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-04 11:47:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:49,457 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-04 11:47:49,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-04 11:47:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-04 11:47:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-04 11:47:49,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:49,458 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-04 11:47:49,458 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:49,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:49,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-04 11:47:49,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:49,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 11:47:51,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:51,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:51,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:51,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:51,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:51,602 INFO 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-04 11:47:51,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:51,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:56,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 11:47:56,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:56,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 11:47:56,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 11:48:02,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:02,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-04 11:48:02,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:02,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 11:48:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 11:48:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:48:02,797 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-04 11:48:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:03,479 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-04 11:48:03,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 11:48:03,479 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-04 11:48:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:03,480 INFO L225 Difference]: With dead ends: 241 [2018-12-04 11:48:03,480 INFO L226 Difference]: Without dead ends: 161 [2018-12-04 11:48:03,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:48:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-04 11:48:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-04 11:48:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-04 11:48:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-04 11:48:03,486 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-04 11:48:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:03,486 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-04 11:48:03,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 11:48:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-04 11:48:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-04 11:48:03,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:03,487 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-04 11:48:03,487 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:03,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-04 11:48:03,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:03,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:03,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 11:48:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:05,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:05,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:05,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:05,809 INFO 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-04 11:48:05,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:05,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:05,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:05,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:05,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 11:48:05,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 11:48:12,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:12,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-04 11:48:12,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:12,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-04 11:48:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-04 11:48:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 11:48:12,479 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-04 11:48:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:13,201 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-04 11:48:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-04 11:48:13,202 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-04 11:48:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:13,203 INFO L225 Difference]: With dead ends: 244 [2018-12-04 11:48:13,203 INFO L226 Difference]: Without dead ends: 163 [2018-12-04 11:48:13,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 11:48:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-04 11:48:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-04 11:48:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-04 11:48:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-04 11:48:13,208 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-04 11:48:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:13,208 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-04 11:48:13,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-04 11:48:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-04 11:48:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-04 11:48:13,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:13,209 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-04 11:48:13,210 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:13,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-04 11:48:13,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:13,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:13,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:13,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:13,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 11:48:15,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:15,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:15,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:15,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:15,580 INFO 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-04 11:48:15,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:15,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:15,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 11:48:15,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 11:48:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-04 11:48:22,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:22,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-04 11:48:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-04 11:48:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 11:48:22,479 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-04 11:48:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:23,220 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-04 11:48:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-04 11:48:23,221 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-04 11:48:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:23,221 INFO L225 Difference]: With dead ends: 247 [2018-12-04 11:48:23,221 INFO L226 Difference]: Without dead ends: 165 [2018-12-04 11:48:23,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 11:48:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-04 11:48:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-04 11:48:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-04 11:48:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-04 11:48:23,225 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-04 11:48:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:23,225 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-04 11:48:23,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-04 11:48:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-04 11:48:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-04 11:48:23,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:23,226 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-04 11:48:23,227 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:23,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-04 11:48:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:23,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:23,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:23,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 11:48:25,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:25,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:25,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:25,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:25,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:25,665 INFO 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-04 11:48:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:48:25,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:48:29,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-04 11:48:29,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:29,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 11:48:29,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 11:48:36,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:36,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-04 11:48:36,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:36,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 11:48:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 11:48:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 11:48:36,011 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-04 11:48:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:36,733 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-04 11:48:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 11:48:36,734 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-04 11:48:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:36,734 INFO L225 Difference]: With dead ends: 250 [2018-12-04 11:48:36,734 INFO L226 Difference]: Without dead ends: 167 [2018-12-04 11:48:36,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 11:48:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-04 11:48:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-04 11:48:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-04 11:48:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-04 11:48:36,738 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-04 11:48:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:36,738 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-04 11:48:36,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 11:48:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-04 11:48:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-04 11:48:36,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:36,739 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-04 11:48:36,739 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:36,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-04 11:48:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:36,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:36,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 11:48:39,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:39,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:39,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:39,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:39,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:39,302 INFO 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-04 11:48:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:39,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:39,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:39,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:39,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 11:48:39,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 11:48:46,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:46,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-04 11:48:46,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:46,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-04 11:48:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-04 11:48:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:46,403 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-04 11:48:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:47,004 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-04 11:48:47,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-04 11:48:47,004 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-04 11:48:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:47,005 INFO L225 Difference]: With dead ends: 253 [2018-12-04 11:48:47,005 INFO L226 Difference]: Without dead ends: 169 [2018-12-04 11:48:47,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-04 11:48:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-04 11:48:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-04 11:48:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-04 11:48:47,010 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-04 11:48:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:47,010 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-04 11:48:47,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-04 11:48:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-04 11:48:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-04 11:48:47,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:47,011 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-04 11:48:47,011 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:47,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-04 11:48:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:47,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:47,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 11:48:49,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:49,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:49,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:49,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:49,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:49,485 INFO 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-04 11:48:49,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:49,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:49,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 11:48:49,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 11:48:56,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:56,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-04 11:48:56,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:56,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-04 11:48:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-04 11:48:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 11:48:56,842 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-04 11:48:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:57,626 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-04 11:48:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-04 11:48:57,626 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-04 11:48:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:57,627 INFO L225 Difference]: With dead ends: 256 [2018-12-04 11:48:57,627 INFO L226 Difference]: Without dead ends: 171 [2018-12-04 11:48:57,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 11:48:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-04 11:48:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-04 11:48:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-04 11:48:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-04 11:48:57,631 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-04 11:48:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:57,631 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-04 11:48:57,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-04 11:48:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-04 11:48:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-04 11:48:57,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:57,632 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-04 11:48:57,632 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:57,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-04 11:48:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:57,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:57,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 11:49:00,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:00,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:00,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:00,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:00,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:00,147 INFO 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-04 11:49:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:00,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:09,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-04 11:49:09,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:09,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 11:49:09,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 11:49:17,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:17,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-04 11:49:17,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:17,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 11:49:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 11:49:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 11:49:17,324 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-04 11:49:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:18,176 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-04 11:49:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 11:49:18,176 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-04 11:49:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:18,177 INFO L225 Difference]: With dead ends: 259 [2018-12-04 11:49:18,177 INFO L226 Difference]: Without dead ends: 173 [2018-12-04 11:49:18,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 11:49:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-04 11:49:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-04 11:49:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-04 11:49:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-04 11:49:18,181 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-04 11:49:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:18,181 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-04 11:49:18,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 11:49:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-04 11:49:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-04 11:49:18,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:18,182 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-04 11:49:18,183 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:18,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-04 11:49:18,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:18,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:18,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:18,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:18,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 11:49:20,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:20,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:20,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:20,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:20,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:20,783 INFO 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-04 11:49:20,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:49:20,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:49:20,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:49:20,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:20,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 11:49:20,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 11:49:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-04 11:49:28,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:28,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-04 11:49:28,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-04 11:49:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 11:49:28,500 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-04 11:49:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:29,405 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-04 11:49:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-04 11:49:29,406 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-04 11:49:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:29,407 INFO L225 Difference]: With dead ends: 262 [2018-12-04 11:49:29,407 INFO L226 Difference]: Without dead ends: 175 [2018-12-04 11:49:29,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 11:49:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-04 11:49:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-04 11:49:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-04 11:49:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-04 11:49:29,411 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-04 11:49:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:29,411 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-04 11:49:29,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-04 11:49:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-04 11:49:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-04 11:49:29,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:29,412 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-04 11:49:29,413 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:29,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-04 11:49:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:29,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:29,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 11:49:32,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:32,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:32,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:32,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:32,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:32,881 INFO 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-04 11:49:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:32,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:49:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:33,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 11:49:33,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 11:49:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:40,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-04 11:49:40,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:40,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-04 11:49:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-04 11:49:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:49:40,704 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-04 11:49:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:41,546 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-04 11:49:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-04 11:49:41,546 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-04 11:49:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:41,547 INFO L225 Difference]: With dead ends: 265 [2018-12-04 11:49:41,547 INFO L226 Difference]: Without dead ends: 177 [2018-12-04 11:49:41,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:49:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-04 11:49:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-04 11:49:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-04 11:49:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-04 11:49:41,551 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-04 11:49:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:41,551 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-04 11:49:41,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-04 11:49:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-04 11:49:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-04 11:49:41,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:41,553 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-04 11:49:41,553 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:41,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-04 11:49:41,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:41,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:41,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 11:49:44,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:44,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:44,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:44,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:44,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:44,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 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-04 11:49:44,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:44,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:54,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-04 11:49:54,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:54,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 11:49:54,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 11:50:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-04 11:50:02,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:02,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 11:50:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 11:50:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 11:50:02,374 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-04 11:50:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:03,098 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-04 11:50:03,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-04 11:50:03,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-04 11:50:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:03,099 INFO L225 Difference]: With dead ends: 268 [2018-12-04 11:50:03,099 INFO L226 Difference]: Without dead ends: 179 [2018-12-04 11:50:03,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 11:50:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-04 11:50:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-04 11:50:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-04 11:50:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-04 11:50:03,103 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-04 11:50:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:03,103 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-04 11:50:03,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 11:50:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-04 11:50:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-04 11:50:03,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:03,104 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-04 11:50:03,104 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:03,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-04 11:50:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:03,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:03,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 11:50:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:05,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:05,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:05,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:05,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:05,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 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-04 11:50:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:05,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:05,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:05,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:05,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 11:50:06,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 11:50:14,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:14,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-04 11:50:14,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:14,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-04 11:50:14,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-04 11:50:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 11:50:14,039 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-04 11:50:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:14,995 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-04 11:50:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-04 11:50:14,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-04 11:50:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:14,996 INFO L225 Difference]: With dead ends: 271 [2018-12-04 11:50:14,996 INFO L226 Difference]: Without dead ends: 181 [2018-12-04 11:50:14,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 11:50:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-04 11:50:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-04 11:50:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-04 11:50:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-04 11:50:15,001 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-04 11:50:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:15,001 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-04 11:50:15,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-04 11:50:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-04 11:50:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-04 11:50:15,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:15,002 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-04 11:50:15,002 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:15,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-04 11:50:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:15,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:15,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 11:50:17,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:17,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:17,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:17,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:17,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:17,919 INFO 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-04 11:50:17,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:17,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:50:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:18,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 11:50:18,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 11:50:26,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:26,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-04 11:50:26,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:26,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 11:50:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 11:50:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 11:50:26,310 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-04 11:50:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:27,096 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-04 11:50:27,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 11:50:27,096 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-04 11:50:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:27,097 INFO L225 Difference]: With dead ends: 274 [2018-12-04 11:50:27,097 INFO L226 Difference]: Without dead ends: 183 [2018-12-04 11:50:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 11:50:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-04 11:50:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-04 11:50:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-04 11:50:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-04 11:50:27,102 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-04 11:50:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:27,102 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-04 11:50:27,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 11:50:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-04 11:50:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-04 11:50:27,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:27,103 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-04 11:50:27,103 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:27,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-04 11:50:27,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:27,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 11:50:30,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:30,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:30,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:30,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:30,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:30,012 INFO 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-04 11:50:30,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:50:30,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:50:35,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-04 11:50:35,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:35,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 11:50:35,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 11:50:43,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:43,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-04 11:50:43,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:43,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 11:50:43,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 11:50:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:50:43,807 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-04 11:50:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:44,588 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-04 11:50:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-04 11:50:44,588 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-04 11:50:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:44,589 INFO L225 Difference]: With dead ends: 277 [2018-12-04 11:50:44,589 INFO L226 Difference]: Without dead ends: 185 [2018-12-04 11:50:44,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:50:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-04 11:50:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-04 11:50:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-04 11:50:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-04 11:50:44,592 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-04 11:50:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:44,593 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-04 11:50:44,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 11:50:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-04 11:50:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-04 11:50:44,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:44,594 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-04 11:50:44,594 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:44,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-04 11:50:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:44,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:44,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 11:50:47,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:47,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:47,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:47,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:47,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:47,547 INFO 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-04 11:50:47,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:47,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:47,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:47,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:47,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 11:50:47,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 11:50:56,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:56,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-04 11:50:56,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:56,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-04 11:50:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-04 11:50:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 11:50:56,325 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-04 11:50:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:57,147 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-04 11:50:57,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-04 11:50:57,147 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-04 11:50:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:57,148 INFO L225 Difference]: With dead ends: 280 [2018-12-04 11:50:57,148 INFO L226 Difference]: Without dead ends: 187 [2018-12-04 11:50:57,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 11:50:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-04 11:50:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-04 11:50:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-04 11:50:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-04 11:50:57,153 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-04 11:50:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:57,153 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-04 11:50:57,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-04 11:50:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-04 11:50:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-04 11:50:57,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:57,154 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-04 11:50:57,155 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:57,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-04 11:50:57,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:57,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:57,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 11:51:00,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:00,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:00,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:00,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:00,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:00,209 INFO 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-04 11:51:00,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:00,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:00,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 11:51:00,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 11:51:09,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-04 11:51:09,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-04 11:51:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-04 11:51:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 11:51:09,200 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-04 11:51:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:10,350 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-04 11:51:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-04 11:51:10,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-04 11:51:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:10,351 INFO L225 Difference]: With dead ends: 283 [2018-12-04 11:51:10,351 INFO L226 Difference]: Without dead ends: 189 [2018-12-04 11:51:10,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 11:51:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-04 11:51:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-04 11:51:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-04 11:51:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-04 11:51:10,356 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-04 11:51:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:10,356 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-04 11:51:10,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-04 11:51:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-04 11:51:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-04 11:51:10,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:10,357 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-04 11:51:10,357 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:10,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-04 11:51:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:10,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 11:51:13,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:13,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:13,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:13,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:13,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:51:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:51:13,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:51:19,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-04 11:51:19,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:19,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 11:51:19,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 11:51:28,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:28,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-04 11:51:28,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:28,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 11:51:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 11:51:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 11:51:28,284 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-04 11:51:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:29,198 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-04 11:51:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 11:51:29,198 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-04 11:51:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:29,200 INFO L225 Difference]: With dead ends: 286 [2018-12-04 11:51:29,200 INFO L226 Difference]: Without dead ends: 191 [2018-12-04 11:51:29,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 11:51:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-04 11:51:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-04 11:51:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-04 11:51:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-04 11:51:29,205 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-04 11:51:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:29,206 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-04 11:51:29,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 11:51:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-04 11:51:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-04 11:51:29,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:29,207 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-04 11:51:29,207 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:29,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-04 11:51:29,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:29,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:29,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 11:51:32,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:32,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:32,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:32,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:32,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:32,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:51:32,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:51:32,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:51:32,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:51:32,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:32,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 11:51:32,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 11:51:41,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:41,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-04 11:51:41,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:41,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-04 11:51:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-04 11:51:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:51:41,712 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-04 11:51:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:42,896 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-04 11:51:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-04 11:51:42,896 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-04 11:51:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:42,897 INFO L225 Difference]: With dead ends: 289 [2018-12-04 11:51:42,897 INFO L226 Difference]: Without dead ends: 193 [2018-12-04 11:51:42,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:51:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-04 11:51:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-04 11:51:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-04 11:51:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-04 11:51:42,902 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-04 11:51:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:42,902 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-04 11:51:42,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-04 11:51:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-04 11:51:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-04 11:51:42,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:42,903 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-04 11:51:42,903 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:42,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-04 11:51:42,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:42,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:42,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:42,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:42,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 11:51:46,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:46,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:46,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:51:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:46,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:46,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 11:51:46,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 11:51:55,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-04 11:51:55,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:55,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-04 11:51:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-04 11:51:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 11:51:55,707 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-04 11:51:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:56,901 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-04 11:51:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-04 11:51:56,901 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-04 11:51:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:56,902 INFO L225 Difference]: With dead ends: 292 [2018-12-04 11:51:56,902 INFO L226 Difference]: Without dead ends: 195 [2018-12-04 11:51:56,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 11:51:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-04 11:51:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-04 11:51:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-04 11:51:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-04 11:51:56,906 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-04 11:51:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:56,906 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-04 11:51:56,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-04 11:51:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-04 11:51:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-04 11:51:56,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:56,907 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-04 11:51:56,907 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:56,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-04 11:51:56,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:56,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:56,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 11:52:00,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:00,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:00,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:00,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:00,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:00,199 INFO 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-04 11:52:00,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:52:00,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:52:07,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-04 11:52:07,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:07,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 11:52:07,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 11:52:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-04 11:52:16,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:16,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-04 11:52:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-04 11:52:16,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 11:52:16,594 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-04 11:52:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:17,954 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-04 11:52:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-04 11:52:17,954 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-04 11:52:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:17,955 INFO L225 Difference]: With dead ends: 295 [2018-12-04 11:52:17,955 INFO L226 Difference]: Without dead ends: 197 [2018-12-04 11:52:17,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 11:52:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-04 11:52:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-04 11:52:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-04 11:52:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-04 11:52:17,960 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-04 11:52:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-04 11:52:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-04 11:52:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-04 11:52:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-04 11:52:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:17,961 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-04 11:52:17,961 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-04 11:52:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:17,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:17,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 11:52:21,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:21,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:21,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:21,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:21,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:21,311 INFO 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-04 11:52:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:52:21,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:52:21,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:52:21,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:21,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 11:52:21,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 11:52:31,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:31,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-04 11:52:31,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-04 11:52:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-04 11:52:31,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 11:52:31,212 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-04 11:52:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:32,588 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-04 11:52:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 11:52:32,589 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-04 11:52:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:32,589 INFO L225 Difference]: With dead ends: 298 [2018-12-04 11:52:32,589 INFO L226 Difference]: Without dead ends: 199 [2018-12-04 11:52:32,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 11:52:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-04 11:52:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-04 11:52:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-04 11:52:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-04 11:52:32,593 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-04 11:52:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:32,594 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-04 11:52:32,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-04 11:52:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-04 11:52:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-04 11:52:32,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:32,594 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-04 11:52:32,595 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:32,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-04 11:52:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:32,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:32,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:32,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 11:52:36,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:36,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:36,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:36,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:36,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:36,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:52:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:36,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:52:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:36,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 11:52:36,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 11:52:46,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:46,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-04 11:52:46,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:46,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-04 11:52:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-04 11:52:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:52:46,135 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-04 11:52:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:47,214 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-04 11:52:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-04 11:52:47,214 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-04 11:52:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:47,215 INFO L225 Difference]: With dead ends: 301 [2018-12-04 11:52:47,215 INFO L226 Difference]: Without dead ends: 201 [2018-12-04 11:52:47,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:52:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-04 11:52:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-04 11:52:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-04 11:52:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-04 11:52:47,219 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-04 11:52:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:47,219 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-04 11:52:47,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-04 11:52:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-04 11:52:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-04 11:52:47,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:47,220 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-04 11:52:47,220 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:47,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-04 11:52:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:47,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:47,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 11:52:50,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:50,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:50,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:50,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:50,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:50,733 INFO 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-04 11:52:50,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:52:50,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:53:06,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-04 11:53:06,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:06,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 11:53:06,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 11:53:16,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:16,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-04 11:53:16,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:16,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 11:53:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 11:53:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 11:53:16,666 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-04 11:53:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:18,019 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-04 11:53:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-04 11:53:18,020 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-04 11:53:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:18,020 INFO L225 Difference]: With dead ends: 304 [2018-12-04 11:53:18,020 INFO L226 Difference]: Without dead ends: 203 [2018-12-04 11:53:18,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 11:53:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-04 11:53:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-04 11:53:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-04 11:53:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-04 11:53:18,024 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-04 11:53:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:18,025 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-04 11:53:18,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 11:53:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-04 11:53:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-04 11:53:18,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:18,025 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-04 11:53:18,026 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:18,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-04 11:53:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:18,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:18,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 11:53:21,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:21,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:21,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:21,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:21,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:21,552 INFO 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-04 11:53:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:53:21,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:53:21,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:53:21,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:21,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 11:53:21,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 11:53:32,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-04 11:53:32,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:32,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-04 11:53:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-04 11:53:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 11:53:32,045 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-04 11:53:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:33,542 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-04 11:53:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-04 11:53:33,542 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-04 11:53:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:33,543 INFO L225 Difference]: With dead ends: 307 [2018-12-04 11:53:33,543 INFO L226 Difference]: Without dead ends: 205 [2018-12-04 11:53:33,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 11:53:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-04 11:53:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-04 11:53:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-04 11:53:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-04 11:53:33,547 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-04 11:53:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:33,547 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-04 11:53:33,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-04 11:53:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-04 11:53:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-04 11:53:33,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:33,548 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-04 11:53:33,548 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:33,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-04 11:53:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:33,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:33,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 11:53:37,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:37,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:37,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:37,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:37,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:37,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 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-04 11:53:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:37,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:53:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:37,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 11:53:37,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 11:53:47,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-04 11:53:47,955 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:47,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-04 11:53:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-04 11:53:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 11:53:47,957 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-04 11:53:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:49,436 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-04 11:53:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 11:53:49,436 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-04 11:53:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:49,438 INFO L225 Difference]: With dead ends: 310 [2018-12-04 11:53:49,438 INFO L226 Difference]: Without dead ends: 207 [2018-12-04 11:53:49,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 11:53:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-04 11:53:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-04 11:53:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-04 11:53:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-04 11:53:49,443 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-04 11:53:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:49,444 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-04 11:53:49,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-04 11:53:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-04 11:53:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-04 11:53:49,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:49,445 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-04 11:53:49,445 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:49,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-04 11:53:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:49,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 11:53:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:53,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:53,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:53,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:53,201 INFO 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-04 11:53:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:53:53,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:54:13,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-04 11:54:13,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:13,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 11:54:13,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 11:54:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-04 11:54:24,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-04 11:54:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-04 11:54:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:54:24,149 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-12-04 11:54:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:25,779 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2018-12-04 11:54:25,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-04 11:54:25,779 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-12-04 11:54:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:25,781 INFO L225 Difference]: With dead ends: 313 [2018-12-04 11:54:25,781 INFO L226 Difference]: Without dead ends: 209 [2018-12-04 11:54:25,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:54:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-04 11:54:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-04 11:54:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-04 11:54:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-04 11:54:25,786 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-12-04 11:54:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:25,786 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-04 11:54:25,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-04 11:54:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-04 11:54:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-04 11:54:25,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:25,788 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2018-12-04 11:54:25,788 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:25,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2018-12-04 11:54:25,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:25,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:25,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 11:54:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:29,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:29,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:29,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:54:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:29,552 INFO 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-04 11:54:29,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:54:29,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:54:29,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:54:29,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:29,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 11:54:29,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 11:54:40,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:40,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-04 11:54:40,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:40,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-04 11:54:40,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-04 11:54:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 11:54:40,756 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-12-04 11:54:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:42,135 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-12-04 11:54:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-04 11:54:42,136 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-12-04 11:54:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:42,137 INFO L225 Difference]: With dead ends: 316 [2018-12-04 11:54:42,137 INFO L226 Difference]: Without dead ends: 211 [2018-12-04 11:54:42,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 11:54:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-04 11:54:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-04 11:54:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-04 11:54:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-04 11:54:42,143 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-04 11:54:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:42,143 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-04 11:54:42,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-04 11:54:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-04 11:54:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-04 11:54:42,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:42,144 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2018-12-04 11:54:42,144 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:42,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2018-12-04 11:54:42,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:42,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:42,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-04 11:54:46,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:46,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:46,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:46,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:54:46,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:46,024 INFO 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-04 11:54:46,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:54:46,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:54:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:46,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-04 11:54:46,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-04 11:54:57,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:57,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-04 11:54:57,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:57,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-04 11:54:57,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-04 11:54:57,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 11:54:57,398 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-12-04 11:54:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:58,973 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2018-12-04 11:54:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-04 11:54:58,973 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-12-04 11:54:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:58,974 INFO L225 Difference]: With dead ends: 319 [2018-12-04 11:54:58,974 INFO L226 Difference]: Without dead ends: 213 [2018-12-04 11:54:58,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 11:54:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-04 11:54:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-04 11:54:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-04 11:54:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-04 11:54:58,980 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-04 11:54:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:58,980 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-04 11:54:58,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-04 11:54:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-04 11:54:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-04 11:54:58,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:58,981 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2018-12-04 11:54:58,981 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:58,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2018-12-04 11:54:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:58,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:58,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:54:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:58,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2018-12-04 11:55:02,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:02,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:02,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:02,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:02,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:02,945 INFO 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-04 11:55:02,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:55:02,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:55:12,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-04 11:55:12,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:55:12,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2018-12-04 11:55:12,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2018-12-04 11:55:23,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:23,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-04 11:55:23,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:23,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 11:55:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 11:55:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 11:55:23,622 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2018-12-04 11:55:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:24,875 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2018-12-04 11:55:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-04 11:55:24,875 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-12-04 11:55:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:24,876 INFO L225 Difference]: With dead ends: 322 [2018-12-04 11:55:24,876 INFO L226 Difference]: Without dead ends: 215 [2018-12-04 11:55:24,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 11:55:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-04 11:55:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-04 11:55:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-04 11:55:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-12-04 11:55:24,880 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-12-04 11:55:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:24,880 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-12-04 11:55:24,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 11:55:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-12-04 11:55:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-04 11:55:24,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:24,881 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2018-12-04 11:55:24,881 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:24,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2018-12-04 11:55:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:24,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:55:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:24,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2018-12-04 11:55:28,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:28,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:28,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:28,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:28,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:28,780 INFO 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-04 11:55:28,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:55:28,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:55:28,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:55:28,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:55:28,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2018-12-04 11:55:28,976 INFO L316 TraceCheckSpWp]: Computing backward predicates...