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/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:47,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:47,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:47,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:47,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:47,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:47,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:47,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:47,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:47,942 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:47,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:47,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:47,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:47,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:47,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:47,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:47,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:47,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:47,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:47,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:47,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:47,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:47,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:47,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:47,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:47,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:47,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:47,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:47,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:47,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:47,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:47,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:47,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:47,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:47,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:47,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:47,984 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,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:48,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:48,006 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:48,006 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:48,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:48,008 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:48,008 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:48,008 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:48,008 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:48,009 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:48,009 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:48,009 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:48,009 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:48,009 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:48,010 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:48,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:48,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:48,011 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:48,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:48,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:48,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:48,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:48,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:48,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:48,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:48,015 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:48,015 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:48,015 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:48,015 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:48,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:48,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:48,016 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:48,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:48,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:48,017 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:48,017 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:48,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:48,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:48,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:48,018 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:48,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:48,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:48,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:48,083 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:48,084 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:48,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2018-12-04 11:42:48,085 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2018-12-04 11:42:48,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:48,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:48,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:48,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:42:48,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:42:48,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:42:48,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:42:48,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:42:48,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:42:48,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.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,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:42:48,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:42:48,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:42:48,515 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-04 11:42:48,516 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48 BoogieIcfgContainer [2018-12-04 11:42:48,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:42:48,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:42:48,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:42:48,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:42:48,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/2) ... [2018-12-04 11:42:48,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380bdb4c and model type array1.i_3.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,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48" (2/2) ... [2018-12-04 11:42:48,524 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2018-12-04 11:42:48,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:42:48,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:42:48,562 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:42:48,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:42:48,595 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:42:48,595 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:42:48,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:42:48,596 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:42:48,596 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:42:48,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:42:48,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:42:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:42:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-04 11:42:48,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-04 11:42:48,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-04 11:42:48,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:48,765 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,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:42:48,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:48,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:42:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:42:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:42:48,787 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 11:42:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:48,832 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-04 11:42:48,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:42:48,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-04 11:42:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:48,847 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:42:48,847 INFO L226 Difference]: Without dead ends: 5 [2018-12-04 11:42:48,851 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:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-04 11:42:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-04 11:42:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-04 11:42:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-04 11:42:48,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-04 11:42:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:48,888 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-04 11:42:48,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:42:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-04 11:42:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:42:48,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:42:48,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-04 11:42:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:48,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:48,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:48,996 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-04 11:42:48,998 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-04 11:42:49,034 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:49,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:49,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:42:49,143 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-04 11:42:49,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:42:49,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:49,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:42:49,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:49,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:49,422 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-04 11:42:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,459 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-04 11:42:49,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:49,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-04 11:42:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,460 INFO L225 Difference]: With dead ends: 8 [2018-12-04 11:42:49,460 INFO L226 Difference]: Without dead ends: 6 [2018-12-04 11:42:49,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-04 11:42:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-04 11:42:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-04 11:42:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-04 11:42:49,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-04 11:42:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,464 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-04 11:42:49,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-04 11:42:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:42:49,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,465 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-04 11:42:49,465 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-04 11:42:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:49,538 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,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,539 INFO 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,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:49,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:49,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:49,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:49,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:49,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:42:49,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:49,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:49,693 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-04 11:42:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,784 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-04 11:42:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:42:49,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-04 11:42:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,785 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:42:49,785 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:42:49,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:42:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:42:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:42:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-04 11:42:49,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-04 11:42:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,789 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-04 11:42:49,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-04 11:42:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:42:49,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,790 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-04 11:42:49,791 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-04 11:42:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,006 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,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,006 INFO 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,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:50,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:50,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:50,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:42:50,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:42:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:42:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,233 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-04 11:42:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,259 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-04 11:42:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:42:50,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-04 11:42:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,260 INFO L225 Difference]: With dead ends: 10 [2018-12-04 11:42:50,261 INFO L226 Difference]: Without dead ends: 8 [2018-12-04 11:42:50,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-04 11:42:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-04 11:42:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:42:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-04 11:42:50,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-04 11:42:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,265 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-04 11:42:50,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:42:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-04 11:42:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:42:50,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,266 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-04 11:42:50,266 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-04 11:42:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,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:42:50,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,463 INFO 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,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:42:50,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:42:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:42:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:50,660 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-04 11:42:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,681 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-04 11:42:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:42:50,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-04 11:42:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,683 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:42:50,683 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:42:50,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:42:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:42:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:42:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-04 11:42:50,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-04 11:42:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,687 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-04 11:42:50,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:42:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-04 11:42:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:42:50,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,688 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-04 11:42:50,688 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-04 11:42:50,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,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:42:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,793 INFO 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:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:50,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:50,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:42:50,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:42:51,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:42:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:42:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:51,327 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-04 11:42:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,364 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-04 11:42:51,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:42:51,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-04 11:42:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,366 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:42:51,366 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:42:51,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:42:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-04 11:42:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:42:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-04 11:42:51,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-04 11:42:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,370 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-04 11:42:51,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:42:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-04 11:42:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:42:51,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,371 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-04 11:42:51,371 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-04 11:42:51,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,500 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,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,500 INFO 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:51,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:51,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:51,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:51,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:42:51,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:42:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:42:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:42:51,770 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-04 11:42:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,810 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-04 11:42:51,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:42:51,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-04 11:42:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,811 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:42:51,811 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:42:51,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:42:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:42:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:42:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:42:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-04 11:42:51,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-04 11:42:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,816 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-04 11:42:51,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:42:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-04 11:42:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:42:51,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,817 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-04 11:42:51,818 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-04 11:42:51,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,999 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,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:52,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:52,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:52,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:42:52,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:42:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:42:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:52,473 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-04 11:42:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,536 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-04 11:42:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:42:52,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-04 11:42:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,537 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:42:52,537 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:42:52,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:42:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-04 11:42:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:42:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-04 11:42:52,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-04 11:42:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,541 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-04 11:42:52,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:42:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-04 11:42:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:42:52,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,542 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-04 11:42:52,542 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-04 11:42:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:52,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:52,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:52,658 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,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,658 INFO 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:52,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:52,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:52,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:42:52,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:52,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:52,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:52,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:42:52,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:42:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:42:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:52,978 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-04 11:42:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,015 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-04 11:42:53,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:42:53,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-04 11:42:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,016 INFO L225 Difference]: With dead ends: 15 [2018-12-04 11:42:53,016 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:42:53,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:42:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:42:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:42:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-04 11:42:53,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-04 11:42:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,021 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-04 11:42:53,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:42:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-04 11:42:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:42:53,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,022 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-04 11:42:53,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-04 11:42:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,295 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,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,296 INFO 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:53,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:53,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:53,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:53,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:53,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:42:53,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:42:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:42:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:53,608 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-04 11:42:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,654 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-04 11:42:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:42:53,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-04 11:42:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,655 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:42:53,656 INFO L226 Difference]: Without dead ends: 14 [2018-12-04 11:42:53,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-04 11:42:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-04 11:42:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-04 11:42:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-04 11:42:53,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-04 11:42:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,660 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-04 11:42:53,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:42:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-04 11:42:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-04 11:42:53,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,661 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-04 11:42:53,662 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-04 11:42:53,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:53,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,857 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,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:54,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:42:54,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:54,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:42:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:42:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:54,168 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-04 11:42:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,244 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-04 11:42:54,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:42:54,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-04 11:42:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,246 INFO L225 Difference]: With dead ends: 17 [2018-12-04 11:42:54,246 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:42:54,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:42:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:42:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:42:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-04 11:42:54,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-04 11:42:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,251 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-04 11:42:54,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:42:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-04 11:42:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:42:54,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:54,252 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-04 11:42:54,252 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:54,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-04 11:42:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,613 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,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,614 INFO 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:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:54,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:54,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:42:54,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:54,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:55,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-04 11:42:55,136 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:42:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:42:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:42:55,137 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-04 11:42:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:55,160 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-04 11:42:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:42:55,160 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-04 11:42:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:55,161 INFO L225 Difference]: With dead ends: 18 [2018-12-04 11:42:55,161 INFO L226 Difference]: Without dead ends: 16 [2018-12-04 11:42:55,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:42:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-04 11:42:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-04 11:42:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-04 11:42:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-04 11:42:55,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-04 11:42:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:55,166 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-04 11:42:55,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:42:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-04 11:42:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-04 11:42:55,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:55,167 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-04 11:42:55,167 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:55,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-04 11:42:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:55,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:55,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:55,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:55,338 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,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:55,338 INFO 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:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:55,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:55,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:55,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:55,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:55,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:55,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:55,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:42:55,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:55,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:42:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:42:55,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:42:55,680 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-04 11:42:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:55,732 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-04 11:42:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:42:55,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-04 11:42:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:55,738 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:42:55,738 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:42:55,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:42:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:42:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:42:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:42:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-04 11:42:55,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-04 11:42:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:55,747 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-04 11:42:55,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:42:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-04 11:42:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:42:55,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:55,748 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-04 11:42:55,748 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:55,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-04 11:42:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:55,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:56,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:56,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:56,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:42:56,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,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 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:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:56,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:56,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:57,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:57,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:42:57,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:57,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:42:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:42:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:57,004 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-04 11:42:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:57,066 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-04 11:42:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:42:57,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-04 11:42:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:57,069 INFO L225 Difference]: With dead ends: 20 [2018-12-04 11:42:57,070 INFO L226 Difference]: Without dead ends: 18 [2018-12-04 11:42:57,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-04 11:42:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-04 11:42:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-04 11:42:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-04 11:42:57,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-04 11:42:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:57,074 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-04 11:42:57,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:42:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-04 11:42:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-04 11:42:57,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:57,075 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-04 11:42:57,075 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:57,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-04 11:42:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:57,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:57,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:57,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:57,649 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,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:57,650 INFO 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:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:57,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:57,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:42:57,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:57,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:57,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,307 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 [16, 16, 16] total 31 [2018-12-04 11:42:58,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:58,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:42:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:42:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:42:58,309 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-04 11:42:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:58,339 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-04 11:42:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:42:58,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-04 11:42:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:58,341 INFO L225 Difference]: With dead ends: 21 [2018-12-04 11:42:58,341 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:42:58,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:42:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:42:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:42:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:42:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-04 11:42:58,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-04 11:42:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:58,345 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-04 11:42:58,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:42:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-04 11:42:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:42:58,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:58,346 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-04 11:42:58,347 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:58,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-04 11:42:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:58,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:58,595 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,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,596 INFO 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:58,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:58,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:58,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:58,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:58,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:59,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:59,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:42:59,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:59,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:42:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:42:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:42:59,303 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-04 11:42:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:59,338 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-04 11:42:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:42:59,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-04 11:42:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:59,339 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:42:59,340 INFO L226 Difference]: Without dead ends: 20 [2018-12-04 11:42:59,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:42:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-04 11:42:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-04 11:42:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-04 11:42:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-04 11:42:59,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-04 11:42:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:59,345 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-04 11:42:59,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:42:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-04 11:42:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-04 11:42:59,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:59,346 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-04 11:42:59,346 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:59,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-04 11:42:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:59,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:59,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:00,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:00,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:00,220 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,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:00,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:01,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:43:01,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:01,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:43:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:43:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:01,263 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-04 11:43:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,294 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-04 11:43:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:43:01,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-04 11:43:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,296 INFO L225 Difference]: With dead ends: 23 [2018-12-04 11:43:01,296 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:43:01,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:43:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:43:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:43:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-04 11:43:01,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-04 11:43:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,301 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-04 11:43:01,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:43:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-04 11:43:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:43:01,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,302 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-04 11:43:01,302 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-04 11:43:01,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:01,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:01,499 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:01,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,500 INFO 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:01,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:01,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:01,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:43:01,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:01,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:02,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:43:02,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:02,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:43:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:43:02,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:02,478 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-04 11:43:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,510 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-04 11:43:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:43:02,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-04 11:43:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,511 INFO L225 Difference]: With dead ends: 24 [2018-12-04 11:43:02,511 INFO L226 Difference]: Without dead ends: 22 [2018-12-04 11:43:02,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-04 11:43:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-04 11:43:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-04 11:43:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-04 11:43:02,517 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-04 11:43:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:02,517 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-04 11:43:02,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:43:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-04 11:43:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-04 11:43:02,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:02,518 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-04 11:43:02,518 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:02,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-04 11:43:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:03,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:03,303 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,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,303 INFO 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,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:03,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:03,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:03,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:03,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:03,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:43:03,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:03,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:43:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:43:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:03,770 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-04 11:43:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:03,811 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-04 11:43:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:43:03,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-04 11:43:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:03,812 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:43:03,813 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:43:03,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:43:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:43:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:43:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-04 11:43:03,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-04 11:43:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:03,818 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-04 11:43:03,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:43:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-04 11:43:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:43:03,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:03,819 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-04 11:43:03,819 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:03,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-04 11:43:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,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:43:04,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,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 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,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:04,934 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,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:43:05,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:43:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:43:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:05,510 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-04 11:43:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,585 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-04 11:43:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:43:05,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-04 11:43:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,588 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:43:05,588 INFO L226 Difference]: Without dead ends: 24 [2018-12-04 11:43:05,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-04 11:43:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-04 11:43:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 11:43:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-04 11:43:05,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-04 11:43:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,592 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-04 11:43:05,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:43:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-04 11:43:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 11:43:05,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,593 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-04 11:43:05,593 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:05,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-04 11:43:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:05,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:05,901 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:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,901 INFO 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:05,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:05,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:05,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:43:05,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:05,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:43:06,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:06,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:06,601 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-04 11:43:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:06,648 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-04 11:43:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:43:06,648 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-04 11:43:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:06,649 INFO L225 Difference]: With dead ends: 27 [2018-12-04 11:43:06,649 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:43:06,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:43:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:43:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:43:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-04 11:43:06,655 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-04 11:43:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:06,656 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-04 11:43:06,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-04 11:43:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:43:06,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:06,657 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-04 11:43:06,657 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:06,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-04 11:43:06,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:06,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:07,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:07,320 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,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,320 INFO 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,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:07,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:07,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:07,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:07,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:43:08,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:43:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:43:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:08,107 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-04 11:43:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:08,199 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-04 11:43:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:43:08,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-04 11:43:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:08,203 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:43:08,203 INFO L226 Difference]: Without dead ends: 26 [2018-12-04 11:43:08,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-04 11:43:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-04 11:43:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-04 11:43:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-04 11:43:08,207 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-04 11:43:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,207 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-04 11:43:08,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:43:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-04 11:43:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-04 11:43:08,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,208 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-04 11:43:08,208 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-04 11:43:08,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:08,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:08,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:08,531 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,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,532 INFO 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,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:08,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:43:09,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:09,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:43:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:43:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:09,344 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-04 11:43:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:09,381 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-04 11:43:09,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:43:09,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-04 11:43:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:09,384 INFO L225 Difference]: With dead ends: 29 [2018-12-04 11:43:09,384 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:43:09,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:43:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:43:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:43:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-04 11:43:09,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-04 11:43:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:09,391 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-04 11:43:09,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:43:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-04 11:43:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:43:09,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:09,392 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-04 11:43:09,392 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-04 11:43:09,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:09,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:09,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:43:09,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:09,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:09,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:43:09,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:09,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:10,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:10,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-04 11:43:10,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:10,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:43:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:43:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:10,686 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-04 11:43:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:10,742 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-04 11:43:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:43:10,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-04 11:43:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:10,743 INFO L225 Difference]: With dead ends: 30 [2018-12-04 11:43:10,744 INFO L226 Difference]: Without dead ends: 28 [2018-12-04 11:43:10,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-04 11:43:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-04 11:43:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 11:43:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-04 11:43:10,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-04 11:43:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:10,750 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-04 11:43:10,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:43:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-04 11:43:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 11:43:10,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:10,751 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-04 11:43:10,751 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-04 11:43:10,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:10,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:10,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:10,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:10,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:11,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:11,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:11,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:11,338 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:11,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:11,338 INFO 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:11,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:11,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:11,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:11,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:11,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:11,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:12,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:12,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:43:12,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:12,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:43:12,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:43:12,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:12,448 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-04 11:43:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:12,501 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-04 11:43:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:43:12,501 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-04 11:43:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:12,502 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:43:12,502 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:43:12,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 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:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:43:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:43:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:43:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-04 11:43:12,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-04 11:43:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-04 11:43:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:43:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-04 11:43:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:43:12,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:12,508 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-04 11:43:12,508 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:12,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-04 11:43:12,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:12,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:12,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:12,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:12,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:12,955 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,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,955 INFO 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:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:12,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:12,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:12,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:43:14,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:14,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:43:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:43:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:14,965 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-04 11:43:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:15,027 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-04 11:43:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:43:15,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-04 11:43:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:15,028 INFO L225 Difference]: With dead ends: 32 [2018-12-04 11:43:15,028 INFO L226 Difference]: Without dead ends: 30 [2018-12-04 11:43:15,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-04 11:43:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-04 11:43:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-04 11:43:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-04 11:43:15,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-04 11:43:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:15,033 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-04 11:43:15,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:43:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-04 11:43:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-04 11:43:15,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:15,033 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-04 11:43:15,034 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:15,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-04 11:43:15,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:15,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:15,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:43:15,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,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 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:15,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:15,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:15,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:43:15,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:15,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-04 11:43:16,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:16,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:16,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:16,570 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-04 11:43:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:16,798 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-04 11:43:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:43:16,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-04 11:43:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:16,799 INFO L225 Difference]: With dead ends: 33 [2018-12-04 11:43:16,799 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:43:16,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:43:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:43:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:43:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-04 11:43:16,804 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-04 11:43:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:16,804 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-04 11:43:16,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-04 11:43:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:43:16,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:16,805 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-04 11:43:16,805 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:16,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-04 11:43:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:16,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:16,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:16,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:17,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:17,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:17,878 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,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:17,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:17,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:17,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:17,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:17,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:18,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:18,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:43:18,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:18,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:43:18,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:43:18,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:18,757 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-04 11:43:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:18,789 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-04 11:43:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:43:18,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-04 11:43:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:18,790 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:43:18,790 INFO L226 Difference]: Without dead ends: 32 [2018-12-04 11:43:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-04 11:43:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-04 11:43:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-04 11:43:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-04 11:43:18,795 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-04 11:43:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:18,795 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-04 11:43:18,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:43:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-04 11:43:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-04 11:43:18,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:18,796 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-04 11:43:18,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:18,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-04 11:43:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:19,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:19,266 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,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,267 INFO 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,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:19,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:20,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:20,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:43:20,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:20,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:43:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:43:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:20,251 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-04 11:43:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:20,352 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-04 11:43:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:43:20,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-04 11:43:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:20,353 INFO L225 Difference]: With dead ends: 35 [2018-12-04 11:43:20,353 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:43:20,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:43:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:43:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:43:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-04 11:43:20,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-04 11:43:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:20,358 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-04 11:43:20,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:43:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-04 11:43:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:43:20,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:20,359 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-04 11:43:20,360 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:20,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-04 11:43:20,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:20,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:20,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:20,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:20,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:20,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:20,786 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:20,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:20,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:20,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:20,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:43:20,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:20,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:22,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:22,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-04 11:43:22,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:22,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:43:22,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:43:22,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:22,010 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-04 11:43:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:22,062 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-04 11:43:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:43:22,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-04 11:43:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:22,063 INFO L225 Difference]: With dead ends: 36 [2018-12-04 11:43:22,063 INFO L226 Difference]: Without dead ends: 34 [2018-12-04 11:43:22,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-04 11:43:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-04 11:43:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-04 11:43:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-04 11:43:22,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-04 11:43:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:22,067 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-04 11:43:22,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:43:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-04 11:43:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-04 11:43:22,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:22,067 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-04 11:43:22,067 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:22,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-04 11:43:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:22,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:22,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:22,790 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:22,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,790 INFO 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:22,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:22,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:22,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:22,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:22,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:22,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:43:23,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:23,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:43:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:43:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:23,837 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-04 11:43:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:23,919 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-04 11:43:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:43:23,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-04 11:43:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:23,920 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:43:23,920 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:43:23,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:43:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:43:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:43:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-04 11:43:23,923 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-04 11:43:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:23,923 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-04 11:43:23,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:43:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-04 11:43:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:43:23,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:23,923 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-04 11:43:23,924 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:23,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-04 11:43:23,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:24,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:24,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:24,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:43:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,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 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:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:24,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:24,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:43:25,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:25,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:43:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:43:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:25,996 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-04 11:43:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:26,060 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-04 11:43:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:43:26,061 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-04 11:43:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:26,061 INFO L225 Difference]: With dead ends: 38 [2018-12-04 11:43:26,061 INFO L226 Difference]: Without dead ends: 36 [2018-12-04 11:43:26,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-04 11:43:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-04 11:43:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-04 11:43:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-04 11:43:26,065 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-04 11:43:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:26,065 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-04 11:43:26,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:43:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-04 11:43:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-04 11:43:26,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:26,066 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-04 11:43:26,066 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:26,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:26,066 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-04 11:43:26,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:26,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:26,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:26,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:26,603 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,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,604 INFO 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:26,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:26,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:26,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:43:26,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:26,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:26,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:27,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:27,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:43:27,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:27,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:43:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:43:27,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:43:27,990 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-04 11:43:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:28,054 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-04 11:43:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:43:28,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-04 11:43:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:28,055 INFO L225 Difference]: With dead ends: 39 [2018-12-04 11:43:28,055 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:43:28,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 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:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:43:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:43:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:43:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-04 11:43:28,059 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-04 11:43:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:28,059 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-04 11:43:28,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:43:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-04 11:43:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:43:28,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:28,060 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-04 11:43:28,060 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:28,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-04 11:43:28,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:28,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:28,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:28,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:28,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:28,586 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,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,586 INFO 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:28,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:28,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:28,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:28,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:28,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:28,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:29,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:29,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:43:29,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:29,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:43:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:43:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:29,860 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-04 11:43:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:29,962 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-04 11:43:29,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:43:29,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-04 11:43:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:29,963 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:43:29,963 INFO L226 Difference]: Without dead ends: 38 [2018-12-04 11:43:29,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-04 11:43:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-04 11:43:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-04 11:43:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-04 11:43:29,965 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-04 11:43:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:29,966 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-04 11:43:29,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:43:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-04 11:43:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-04 11:43:29,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:29,966 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-04 11:43:29,966 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:29,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-04 11:43:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:30,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:30,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:30,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:43:30,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,550 INFO 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:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:30,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:30,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:30,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:31,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:43:31,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:31,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:43:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:43:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:31,909 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-04 11:43:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:31,975 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-04 11:43:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:43:31,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-04 11:43:31,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:31,976 INFO L225 Difference]: With dead ends: 41 [2018-12-04 11:43:31,976 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:43:31,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:43:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:43:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:43:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-04 11:43:31,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-04 11:43:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:31,981 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-04 11:43:31,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:43:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-04 11:43:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:43:31,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:31,981 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-04 11:43:31,981 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:31,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-04 11:43:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:32,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:32,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:32,711 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,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:32,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:32,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:43:32,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:32,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:32,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:34,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:43:34,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:34,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:43:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:43:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:34,200 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-04 11:43:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:34,247 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-04 11:43:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:43:34,247 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-04 11:43:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:34,248 INFO L225 Difference]: With dead ends: 42 [2018-12-04 11:43:34,248 INFO L226 Difference]: Without dead ends: 40 [2018-12-04 11:43:34,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-04 11:43:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-04 11:43:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-04 11:43:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-04 11:43:34,251 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-04 11:43:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:34,252 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-04 11:43:34,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:43:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-04 11:43:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-04 11:43:34,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:34,252 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-04 11:43:34,252 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:34,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-04 11:43:34,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:34,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:34,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:34,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:34,818 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:34,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:34,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:34,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:34,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:34,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:34,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:34,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:36,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:36,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:43:36,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:36,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:43:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:43:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:43:36,679 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-04 11:43:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:36,736 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-04 11:43:36,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:43:36,737 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-04 11:43:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:36,737 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:43:36,738 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:43:36,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 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:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:43:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:43:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:43:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-04 11:43:36,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-04 11:43:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:36,741 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-04 11:43:36,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:43:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-04 11:43:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:43:36,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:36,742 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-04 11:43:36,742 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:36,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-04 11:43:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:36,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:36,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:37,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:37,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:37,341 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:37,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,342 INFO 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:37,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:37,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:37,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:39,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:43:39,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:43:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:43:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:39,108 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-04 11:43:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:39,169 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-04 11:43:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:43:39,170 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-04 11:43:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:39,171 INFO L225 Difference]: With dead ends: 44 [2018-12-04 11:43:39,171 INFO L226 Difference]: Without dead ends: 42 [2018-12-04 11:43:39,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-04 11:43:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-04 11:43:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-04 11:43:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-04 11:43:39,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-04 11:43:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:39,173 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-04 11:43:39,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:43:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-04 11:43:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-04 11:43:39,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:39,175 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-04 11:43:39,175 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:39,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-04 11:43:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:39,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:39,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:39,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:39,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:39,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:43:39,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,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 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:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:40,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:40,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:43:40,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:40,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:40,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:41,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:41,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:43:41,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:41,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:43:41,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:43:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:41,743 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-04 11:43:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:41,798 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-04 11:43:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:43:41,799 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-04 11:43:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:41,799 INFO L225 Difference]: With dead ends: 45 [2018-12-04 11:43:41,799 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:43:41,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:43:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:43:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:43:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-04 11:43:41,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-04 11:43:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:41,803 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-04 11:43:41,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:43:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-04 11:43:41,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:43:41,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:41,804 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-04 11:43:41,804 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:41,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-04 11:43:41,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:41,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:41,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:41,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:41,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:42,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:42,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:42,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:42,506 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:42,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:42,506 INFO 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:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:42,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:42,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:42,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:42,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:42,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:44,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:44,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:43:44,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:44,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:43:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:43:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:44,544 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-04 11:43:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:44,612 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-04 11:43:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:43:44,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-04 11:43:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:44,613 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:43:44,613 INFO L226 Difference]: Without dead ends: 44 [2018-12-04 11:43:44,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-04 11:43:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-04 11:43:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-04 11:43:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-04 11:43:44,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-04 11:43:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:44,617 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-04 11:43:44,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:43:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-04 11:43:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-04 11:43:44,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:44,617 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-04 11:43:44,618 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-04 11:43:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:44,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:44,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:45,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:45,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:45,300 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:45,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,301 INFO 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:45,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:45,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:45,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:45,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:47,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:43:47,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:47,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:43:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:43:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:43:47,489 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-04 11:43:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:47,583 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-04 11:43:47,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:43:47,584 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-04 11:43:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:47,585 INFO L225 Difference]: With dead ends: 47 [2018-12-04 11:43:47,585 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:43:47,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:43:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:43:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:43:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:43:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-04 11:43:47,587 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-04 11:43:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:47,588 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-04 11:43:47,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:43:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-04 11:43:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:43:47,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:47,588 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-04 11:43:47,588 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:47,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-04 11:43:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:47,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:49,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:49,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:49,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:49,274 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,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:49,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:49,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:49,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:43:49,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:49,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:49,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:43:51,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:51,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:43:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:43:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:51,309 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-04 11:43:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:51,379 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-04 11:43:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:43:51,379 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-04 11:43:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:51,380 INFO L225 Difference]: With dead ends: 48 [2018-12-04 11:43:51,380 INFO L226 Difference]: Without dead ends: 46 [2018-12-04 11:43:51,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-04 11:43:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-04 11:43:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-04 11:43:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-04 11:43:51,382 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-04 11:43:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:51,382 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-04 11:43:51,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:43:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-04 11:43:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-04 11:43:51,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:51,383 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-04 11:43:51,383 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-04 11:43:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:51,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:51,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:52,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:52,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:52,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:52,171 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:52,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:52,171 INFO 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:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:52,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:52,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:52,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:52,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:52,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:54,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:43:54,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:54,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:43:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:43:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:43:54,305 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-04 11:43:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:54,354 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-04 11:43:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:43:54,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-04 11:43:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:54,355 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:43:54,355 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:43:54,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:43:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:43:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:43:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:43:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-04 11:43:54,358 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-04 11:43:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:54,359 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-04 11:43:54,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:43:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-04 11:43:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:43:54,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:54,360 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-04 11:43:54,360 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:54,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:54,360 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-04 11:43:54,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:54,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:54,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:55,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:55,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:55,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:55,231 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:55,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:55,231 INFO 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:43:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:55,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:55,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:57,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:57,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:43:57,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:57,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:43:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:43:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:43:57,393 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-04 11:43:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:57,463 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-04 11:43:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:43:57,463 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-04 11:43:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:57,464 INFO L225 Difference]: With dead ends: 50 [2018-12-04 11:43:57,464 INFO L226 Difference]: Without dead ends: 48 [2018-12-04 11:43:57,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:43:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-04 11:43:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-04 11:43:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-04 11:43:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-04 11:43:57,466 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-04 11:43:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:57,466 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-04 11:43:57,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:43:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-04 11:43:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-04 11:43:57,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:57,470 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-04 11:43:57,470 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:57,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-04 11:43:57,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:57,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:58,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:58,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:58,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:58,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:58,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:58,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 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:43:58,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:58,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:58,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:43:58,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:58,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:58,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:01,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-04 11:44:01,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:01,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:44:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:44:01,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:01,167 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-04 11:44:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:01,294 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-04 11:44:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:44:01,294 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-04 11:44:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:01,295 INFO L225 Difference]: With dead ends: 51 [2018-12-04 11:44:01,295 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:44:01,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:44:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:44:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:44:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-04 11:44:01,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-04 11:44:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:01,299 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-04 11:44:01,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:44:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-04 11:44:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:44:01,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:01,300 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-04 11:44:01,300 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:01,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-04 11:44:01,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:01,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:01,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:02,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:02,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:02,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:02,162 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:02,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:02,162 INFO 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:02,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:02,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:02,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:02,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:02,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:02,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:04,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:04,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:44:04,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:04,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:44:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:44:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:04,760 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-04 11:44:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:05,097 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-04 11:44:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:44:05,098 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-04 11:44:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:05,098 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:44:05,099 INFO L226 Difference]: Without dead ends: 50 [2018-12-04 11:44:05,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-04 11:44:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-04 11:44:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-04 11:44:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-04 11:44:05,102 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-04 11:44:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:05,103 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-04 11:44:05,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:44:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-04 11:44:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-04 11:44:05,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:05,103 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-04 11:44:05,103 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:05,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-04 11:44:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:05,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:05,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:05,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:05,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:05,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:05,966 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:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:05,967 INFO 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:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:05,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:06,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:06,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:08,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:08,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:44:08,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:08,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:44:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:44:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:08,481 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-04 11:44:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:08,620 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-04 11:44:08,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:44:08,620 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-04 11:44:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:08,620 INFO L225 Difference]: With dead ends: 53 [2018-12-04 11:44:08,621 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:44:08,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:44:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:44:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:44:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-04 11:44:08,623 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-04 11:44:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:08,624 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-04 11:44:08,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:44:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-04 11:44:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:44:08,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:08,624 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-04 11:44:08,625 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:08,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-04 11:44:08,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:08,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:08,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:08,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:09,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:09,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:09,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:44:09,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,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 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:09,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:09,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:09,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:44:09,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:09,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:09,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:12,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:12,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:44:12,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:12,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:44:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:44:12,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:12,359 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-04 11:44:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:12,417 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-04 11:44:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:44:12,418 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-04 11:44:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:12,418 INFO L225 Difference]: With dead ends: 54 [2018-12-04 11:44:12,419 INFO L226 Difference]: Without dead ends: 52 [2018-12-04 11:44:12,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-04 11:44:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-04 11:44:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 11:44:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-04 11:44:12,423 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-04 11:44:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:12,423 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-04 11:44:12,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:44:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-04 11:44:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 11:44:12,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:12,424 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-04 11:44:12,427 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:12,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-04 11:44:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:12,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:12,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:13,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:13,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:13,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:13,633 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:13,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:13,633 INFO 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:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:13,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:13,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:13,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:13,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:13,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:16,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:16,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:44:16,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:16,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:44:16,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:44:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:16,257 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-04 11:44:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:16,400 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-04 11:44:16,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:44:16,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-04 11:44:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:16,401 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:44:16,401 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:44:16,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:44:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:44:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:44:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-04 11:44:16,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-04 11:44:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:16,405 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-04 11:44:16,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:44:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-04 11:44:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:44:16,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:16,405 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-04 11:44:16,406 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:16,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:16,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-04 11:44:16,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:16,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:16,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:16,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:17,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:17,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:17,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:17,502 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:17,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:17,503 INFO 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:17,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:17,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:17,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:17,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:20,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:20,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:44:20,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:20,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:44:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:44:20,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:20,644 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-04 11:44:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:20,701 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-04 11:44:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:44:20,702 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-04 11:44:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:20,703 INFO L225 Difference]: With dead ends: 56 [2018-12-04 11:44:20,703 INFO L226 Difference]: Without dead ends: 54 [2018-12-04 11:44:20,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 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:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-04 11:44:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-04 11:44:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-04 11:44:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-04 11:44:20,706 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-04 11:44:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:20,706 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-04 11:44:20,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:44:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-04 11:44:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-04 11:44:20,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:20,707 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-04 11:44:20,707 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:20,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-04 11:44:20,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:20,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:21,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:21,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:21,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:21,705 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:21,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:21,705 INFO 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:21,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:21,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:21,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:44:21,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:21,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:21,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:24,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:44:24,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:24,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:44:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:44:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:24,963 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-04 11:44:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:25,113 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-04 11:44:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:44:25,114 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-04 11:44:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:25,115 INFO L225 Difference]: With dead ends: 57 [2018-12-04 11:44:25,115 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:44:25,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:44:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:44:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:44:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-04 11:44:25,118 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-04 11:44:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-04 11:44:25,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:44:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-04 11:44:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:44:25,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:25,118 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-04 11:44:25,119 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:25,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-04 11:44:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:25,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:25,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:26,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:26,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:26,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:26,181 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:26,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:26,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:26,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:26,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:26,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:26,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:26,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:44:29,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:29,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:44:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:44:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:29,354 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-04 11:44:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:29,443 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-04 11:44:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:44:29,444 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-04 11:44:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:29,444 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:44:29,445 INFO L226 Difference]: Without dead ends: 56 [2018-12-04 11:44:29,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-04 11:44:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-04 11:44:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 11:44:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-04 11:44:29,447 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-04 11:44:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:29,448 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-04 11:44:29,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:44:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-04 11:44:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 11:44:29,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:29,448 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-04 11:44:29,449 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:29,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-04 11:44:29,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:29,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:29,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:29,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:29,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:30,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:30,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:30,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:30,534 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:30,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:30,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:30,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:30,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:30,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:44:33,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:33,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:44:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:44:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:33,480 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-04 11:44:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:33,580 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-04 11:44:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:44:33,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-04 11:44:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:33,581 INFO L225 Difference]: With dead ends: 59 [2018-12-04 11:44:33,582 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:44:33,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:44:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:44:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:44:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-04 11:44:33,584 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-04 11:44:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:33,585 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-04 11:44:33,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:44:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-04 11:44:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:44:33,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:33,585 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-04 11:44:33,586 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:33,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-04 11:44:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:33,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:34,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:34,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:34,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:34,825 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,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:34,825 INFO 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:34,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:34,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:35,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:44:35,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:35,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:35,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:38,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:38,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-04 11:44:38,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:38,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-04 11:44:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-04 11:44:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:38,088 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-04 11:44:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:38,156 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-04 11:44:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 11:44:38,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-04 11:44:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:38,157 INFO L225 Difference]: With dead ends: 60 [2018-12-04 11:44:38,157 INFO L226 Difference]: Without dead ends: 58 [2018-12-04 11:44:38,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-04 11:44:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-04 11:44:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-04 11:44:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-04 11:44:38,160 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-04 11:44:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:38,160 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-04 11:44:38,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-04 11:44:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-04 11:44:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-04 11:44:38,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:38,161 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-04 11:44:38,161 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:38,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-04 11:44:38,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:38,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:38,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:39,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:39,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:39,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:39,452 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:39,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:39,452 INFO 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:39,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:39,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:39,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:39,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:39,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:39,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-04 11:44:42,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:42,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:44:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:44:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:44:42,700 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-04 11:44:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:42,789 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-04 11:44:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 11:44:42,789 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-04 11:44:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:42,790 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:44:42,790 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:44:42,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:44:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:44:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:44:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:44:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-04 11:44:42,794 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-04 11:44:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:42,794 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-04 11:44:42,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:44:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-04 11:44:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:44:42,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:42,795 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-04 11:44:42,795 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:42,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-04 11:44:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:42,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:42,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:44,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:44,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:44,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:44,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:44:44,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:44,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 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:44:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:44,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:44,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:44,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:47,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:47,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-04 11:44:47,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:47,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-04 11:44:47,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-04 11:44:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:44:47,541 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-04 11:44:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:47,656 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-04 11:44:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 11:44:47,656 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-04 11:44:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:47,657 INFO L225 Difference]: With dead ends: 62 [2018-12-04 11:44:47,657 INFO L226 Difference]: Without dead ends: 60 [2018-12-04 11:44:47,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:44:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-04 11:44:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-04 11:44:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-04 11:44:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-04 11:44:47,660 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-04 11:44:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:47,660 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-04 11:44:47,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-04 11:44:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-04 11:44:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-04 11:44:47,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:47,661 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-04 11:44:47,661 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:47,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-04 11:44:47,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:47,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:47,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:48,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:48,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:48,863 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:48,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,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 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:44:48,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:48,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:49,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 11:44:49,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:49,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:49,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:52,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:52,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-04 11:44:52,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:52,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:44:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:44:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:44:52,525 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-04 11:44:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:52,597 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-04 11:44:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:44:52,598 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-04 11:44:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:52,598 INFO L225 Difference]: With dead ends: 63 [2018-12-04 11:44:52,599 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:44:52,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:44:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:44:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:44:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:44:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-04 11:44:52,602 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-04 11:44:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:52,603 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-04 11:44:52,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:44:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-04 11:44:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:44:52,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:52,604 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-04 11:44:52,604 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:52,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-04 11:44:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:52,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:52,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:54,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:54,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:54,003 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:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:54,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:54,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:54,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:54,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:54,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:54,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:54,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:57,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:57,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-04 11:44:57,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:57,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-04 11:44:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-04 11:44:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:44:57,556 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-04 11:44:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:57,657 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-04 11:44:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 11:44:57,658 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-04 11:44:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:57,658 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:44:57,659 INFO L226 Difference]: Without dead ends: 62 [2018-12-04 11:44:57,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 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:44:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-04 11:44:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-04 11:44:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-04 11:44:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-04 11:44:57,662 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-04 11:44:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:57,662 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-04 11:44:57,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-04 11:44:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-04 11:44:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-04 11:44:57,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:57,663 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-04 11:44:57,663 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:57,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-04 11:44:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:57,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:57,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:58,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:58,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:58,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:58,983 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:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:58,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:58,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:59,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:59,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-04 11:45:02,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:02,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-04 11:45:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-04 11:45:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:45:02,784 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-04 11:45:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:02,871 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-04 11:45:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 11:45:02,872 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-04 11:45:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:02,874 INFO L225 Difference]: With dead ends: 65 [2018-12-04 11:45:02,874 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:45:02,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 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:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:45:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:45:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:45:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-04 11:45:02,877 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-04 11:45:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:02,878 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-04 11:45:02,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-04 11:45:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-04 11:45:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:45:02,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:02,878 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-04 11:45:02,878 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:02,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-04 11:45:02,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:02,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:02,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:04,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:04,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:04,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:04,382 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:04,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:04,382 INFO 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:04,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:04,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:04,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-04 11:45:04,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:04,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:04,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:08,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-04 11:45:08,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:08,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-04 11:45:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-04 11:45:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:45:08,543 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-04 11:45:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:08,618 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-04 11:45:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:45:08,619 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-04 11:45:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:08,619 INFO L225 Difference]: With dead ends: 66 [2018-12-04 11:45:08,619 INFO L226 Difference]: Without dead ends: 64 [2018-12-04 11:45:08,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:45:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-04 11:45:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-04 11:45:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-04 11:45:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-04 11:45:08,623 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-04 11:45:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:08,623 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-04 11:45:08,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-04 11:45:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-04 11:45:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-04 11:45:08,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:08,624 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-04 11:45:08,624 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:08,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-04 11:45:08,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:08,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:08,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:10,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:10,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:10,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:10,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:10,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:10,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 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:10,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:10,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:10,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:10,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:10,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:10,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:14,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:14,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-04 11:45:14,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:14,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-04 11:45:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-04 11:45:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:45:14,167 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-04 11:45:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:14,274 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-04 11:45:14,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 11:45:14,275 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-04 11:45:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:14,275 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:45:14,275 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:45:14,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:45:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:45:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:45:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:45:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-04 11:45:14,278 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-04 11:45:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:14,278 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-04 11:45:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-04 11:45:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-04 11:45:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:45:14,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:14,279 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-04 11:45:14,279 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:14,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-04 11:45:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:14,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:14,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:15,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:15,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:15,878 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:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:15,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:15,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:15,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:15,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:19,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-04 11:45:19,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:19,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-04 11:45:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-04 11:45:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:19,863 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-04 11:45:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:20,014 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-04 11:45:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 11:45:20,014 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-04 11:45:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:20,015 INFO L225 Difference]: With dead ends: 68 [2018-12-04 11:45:20,015 INFO L226 Difference]: Without dead ends: 66 [2018-12-04 11:45:20,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-04 11:45:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-04 11:45:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-04 11:45:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-04 11:45:20,018 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-04 11:45:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:20,018 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-04 11:45:20,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-04 11:45:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-04 11:45:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-04 11:45:20,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:20,018 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-04 11:45:20,019 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:20,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-04 11:45:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:20,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:20,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:21,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:21,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:21,589 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:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:21,589 INFO 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:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:21,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:21,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 11:45:21,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:21,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:21,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:26,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-04 11:45:26,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:26,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:45:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:45:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 11:45:26,026 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-04 11:45:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:26,138 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-04 11:45:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 11:45:26,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-04 11:45:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:26,139 INFO L225 Difference]: With dead ends: 69 [2018-12-04 11:45:26,139 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:45:26,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 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:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:45:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:45:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:45:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-04 11:45:26,142 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-04 11:45:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:26,142 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-04 11:45:26,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:45:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-04 11:45:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:45:26,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:26,143 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-04 11:45:26,143 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:26,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-04 11:45:26,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:26,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:26,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:26,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:26,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:28,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:28,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:28,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:28,458 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:28,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:28,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:28,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:28,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:28,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:28,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:28,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:32,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:32,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-04 11:45:32,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:32,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-04 11:45:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-04 11:45:32,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:45:32,729 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-04 11:45:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:32,841 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-04 11:45:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-04 11:45:32,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-04 11:45:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:32,844 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:45:32,844 INFO L226 Difference]: Without dead ends: 68 [2018-12-04 11:45:32,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:45:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-04 11:45:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-04 11:45:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-04 11:45:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-04 11:45:32,847 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-04 11:45:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:32,848 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-04 11:45:32,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-04 11:45:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-04 11:45:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-04 11:45:32,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:32,849 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-04 11:45:32,849 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:32,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-04 11:45:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:32,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:32,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:34,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:34,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:34,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:34,383 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:34,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:34,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:34,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:34,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:34,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:39,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:39,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-04 11:45:39,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:39,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-04 11:45:39,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-04 11:45:39,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 11:45:39,826 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-04 11:45:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:39,916 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-04 11:45:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 11:45:39,917 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-04 11:45:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:39,917 INFO L225 Difference]: With dead ends: 71 [2018-12-04 11:45:39,917 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:45:39,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 11:45:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:45:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:45:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:45:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-04 11:45:39,921 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-04 11:45:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:39,921 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-04 11:45:39,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-04 11:45:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-04 11:45:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:45:39,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:39,922 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-04 11:45:39,922 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:39,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-04 11:45:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:39,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:39,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:42,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:42,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:42,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:42,130 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,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:42,130 INFO 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:45:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:42,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:42,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 11:45:42,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:42,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:42,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:47,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:47,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-04 11:45:47,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:47,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-04 11:45:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-04 11:45:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:45:47,113 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-04 11:45:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:47,207 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-04 11:45:47,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 11:45:47,207 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-04 11:45:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:47,208 INFO L225 Difference]: With dead ends: 72 [2018-12-04 11:45:47,208 INFO L226 Difference]: Without dead ends: 70 [2018-12-04 11:45:47,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:45:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-04 11:45:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-04 11:45:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-04 11:45:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-04 11:45:47,212 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-04 11:45:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:47,212 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-04 11:45:47,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-04 11:45:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-04 11:45:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-04 11:45:47,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:47,213 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-04 11:45:47,213 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:47,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-04 11:45:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:47,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:47,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:48,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:48,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:48,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:48,810 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:48,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:48,811 INFO 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:45:48,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:48,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:48,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:48,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:48,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:48,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:53,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:53,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-04 11:45:53,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-04 11:45:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-04 11:45:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 11:45:53,478 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-04 11:45:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:53,776 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-04 11:45:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 11:45:53,777 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-04 11:45:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:53,777 INFO L225 Difference]: With dead ends: 73 [2018-12-04 11:45:53,777 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:45:53,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 11:45:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:45:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:45:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:45:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-04 11:45:53,780 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-04 11:45:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:53,780 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-04 11:45:53,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-04 11:45:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-04 11:45:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:45:53,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:53,781 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-04 11:45:53,781 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:53,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-04 11:45:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:53,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:53,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:55,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:55,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:55,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:55,410 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:55,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:55,410 INFO 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:45:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:55,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:55,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:55,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:00,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:00,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-04 11:46:00,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:00,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-04 11:46:00,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-04 11:46:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 11:46:00,196 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-04 11:46:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:00,284 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-04 11:46:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-04 11:46:00,285 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-04 11:46:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:00,285 INFO L225 Difference]: With dead ends: 74 [2018-12-04 11:46:00,286 INFO L226 Difference]: Without dead ends: 72 [2018-12-04 11:46:00,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 11:46:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-04 11:46:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-04 11:46:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-04 11:46:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-04 11:46:00,288 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-04 11:46:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:00,288 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-04 11:46:00,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-04 11:46:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-04 11:46:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-04 11:46:00,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:00,289 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-04 11:46:00,289 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-04 11:46:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:00,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:01,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:01,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:01,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:01,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:46:01,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:01,994 INFO 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:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:02,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:02,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-04 11:46:02,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:02,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:02,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-04 11:46:07,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:07,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:46:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:46:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 11:46:07,345 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-04 11:46:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:07,547 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-04 11:46:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-04 11:46:07,547 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-04 11:46:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:07,548 INFO L225 Difference]: With dead ends: 75 [2018-12-04 11:46:07,548 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:46:07,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 11:46:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:46:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:46:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:46:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-04 11:46:07,551 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-04 11:46:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:07,551 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-04 11:46:07,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:46:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-04 11:46:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:46:07,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:07,552 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-04 11:46:07,552 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:07,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-04 11:46:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:07,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:07,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:09,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:09,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:09,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:09,261 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:09,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:09,262 INFO 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:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:09,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:09,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:09,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:09,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:09,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:14,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-04 11:46:14,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:14,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-04 11:46:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-04 11:46:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:46:14,364 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-04 11:46:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:14,555 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-04 11:46:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 11:46:14,555 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-04 11:46:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:14,556 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:46:14,556 INFO L226 Difference]: Without dead ends: 74 [2018-12-04 11:46:14,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 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:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-04 11:46:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-04 11:46:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-04 11:46:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-04 11:46:14,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-04 11:46:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-04 11:46:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-04 11:46:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-04 11:46:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-04 11:46:14,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:14,560 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-04 11:46:14,561 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:14,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-04 11:46:14,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:14,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:14,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:16,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:16,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:16,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:16,778 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:16,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:16,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:16,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:16,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:16,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-04 11:46:21,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-04 11:46:21,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-04 11:46:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 11:46:21,970 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-04 11:46:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:22,152 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-04 11:46:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-04 11:46:22,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-04 11:46:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:22,153 INFO L225 Difference]: With dead ends: 77 [2018-12-04 11:46:22,153 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:46:22,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 11:46:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:46:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:46:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:46:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-04 11:46:22,158 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-04 11:46:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:22,158 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-04 11:46:22,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-04 11:46:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-04 11:46:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:46:22,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:22,159 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-04 11:46:22,159 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:22,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-04 11:46:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:22,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:22,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:22,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:22,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:24,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:24,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:24,000 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:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:24,001 INFO 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:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:24,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:24,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-04 11:46:24,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:24,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:24,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:29,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-04 11:46:29,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:29,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 11:46:29,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 11:46:29,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 11:46:29,886 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-04 11:46:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:30,022 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-04 11:46:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-04 11:46:30,022 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-04 11:46:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:30,023 INFO L225 Difference]: With dead ends: 78 [2018-12-04 11:46:30,023 INFO L226 Difference]: Without dead ends: 76 [2018-12-04 11:46:30,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 11:46:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-04 11:46:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-04 11:46:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-04 11:46:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-04 11:46:30,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-04 11:46:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:30,026 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-04 11:46:30,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 11:46:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-04 11:46:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-04 11:46:30,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:30,027 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-04 11:46:30,027 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:30,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-04 11:46:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:30,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:30,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:30,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:31,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:31,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:31,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:31,921 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:31,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:31,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46:31,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:31,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:31,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:31,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:31,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:31,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-04 11:46:37,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:37,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 11:46:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 11:46:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 11:46:37,511 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-04 11:46:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:37,653 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-04 11:46:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 11:46:37,653 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-04 11:46:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:37,654 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:46:37,654 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:46:37,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 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:46:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:46:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:46:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:46:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-04 11:46:37,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-04 11:46:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:37,657 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-04 11:46:37,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 11:46:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-04 11:46:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:46:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:37,658 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-04 11:46:37,658 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-04 11:46:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:37,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:37,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:39,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:39,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:39,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:39,593 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,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:39,593 INFO 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:46:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:39,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:39,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:39,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-04 11:46:45,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-04 11:46:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-04 11:46:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:46:45,264 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-04 11:46:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:45,411 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-04 11:46:45,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 11:46:45,412 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-04 11:46:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:45,412 INFO L225 Difference]: With dead ends: 80 [2018-12-04 11:46:45,412 INFO L226 Difference]: Without dead ends: 78 [2018-12-04 11:46:45,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:46:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-04 11:46:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-04 11:46:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-04 11:46:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-04 11:46:45,415 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-04 11:46:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:45,415 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-04 11:46:45,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-04 11:46:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-04 11:46:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-04 11:46:45,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:45,416 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-04 11:46:45,416 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:45,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-04 11:46:45,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:45,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:45,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:47,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:47,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:47,416 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,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:47,416 INFO 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:46:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:47,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:48,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 11:46:48,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:48,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:48,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:53,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:53,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-04 11:46:53,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:53,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:46:53,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:46:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 11:46:53,883 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-04 11:46:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:53,987 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-04 11:46:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-04 11:46:53,987 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-04 11:46:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:53,987 INFO L225 Difference]: With dead ends: 81 [2018-12-04 11:46:53,987 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:46:53,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 11:46:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:46:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:46:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:46:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-04 11:46:53,990 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-04 11:46:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:53,991 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-04 11:46:53,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:46:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-04 11:46:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:46:53,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:53,992 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-04 11:46:53,993 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:53,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-04 11:46:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:53,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:53,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:53,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:56,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:56,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:56,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:56,049 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:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:56,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46:56,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:56,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:56,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:56,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:56,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:56,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-04 11:47:03,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-04 11:47:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-04 11:47:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 11:47:03,556 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-04 11:47:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:03,666 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-04 11:47:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-04 11:47:03,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-04 11:47:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:03,667 INFO L225 Difference]: With dead ends: 82 [2018-12-04 11:47:03,667 INFO L226 Difference]: Without dead ends: 80 [2018-12-04 11:47:03,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 11:47:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-04 11:47:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-04 11:47:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 11:47:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-04 11:47:03,670 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-04 11:47:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:03,670 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-04 11:47:03,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-04 11:47:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-04 11:47:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 11:47:03,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:03,671 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-04 11:47:03,671 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:03,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-04 11:47:03,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:03,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:03,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:05,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:05,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:05,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:05,763 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,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:05,763 INFO 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:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:05,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:05,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:05,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:12,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:12,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-04 11:47:12,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-04 11:47:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-04 11:47:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 11:47:12,083 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-04 11:47:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:12,444 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-04 11:47:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-04 11:47:12,444 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-04 11:47:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:12,445 INFO L225 Difference]: With dead ends: 83 [2018-12-04 11:47:12,445 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:47:12,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 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:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:47:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:47:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:47:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-04 11:47:12,448 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-04 11:47:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:12,448 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-04 11:47:12,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-04 11:47:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-04 11:47:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:47:12,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:12,449 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-04 11:47:12,449 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:12,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-04 11:47:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:12,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:12,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:14,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:14,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:14,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:14,603 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:14,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:14,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:14,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:15,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 11:47:15,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:15,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:15,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:21,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:21,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-04 11:47:21,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:21,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 11:47:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 11:47:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:47:21,578 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-04 11:47:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:22,196 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-04 11:47:22,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 11:47:22,197 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-04 11:47:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:22,198 INFO L225 Difference]: With dead ends: 84 [2018-12-04 11:47:22,198 INFO L226 Difference]: Without dead ends: 82 [2018-12-04 11:47:22,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:47:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-04 11:47:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-04 11:47:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-04 11:47:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-04 11:47:22,201 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-04 11:47:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:22,201 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-04 11:47:22,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 11:47:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-04 11:47:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-04 11:47:22,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:22,202 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-04 11:47:22,202 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:22,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:22,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-04 11:47:22,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:22,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:22,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:24,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:24,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:24,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:24,525 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:24,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:24,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47:24,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:24,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:24,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:24,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:24,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:24,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:31,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:31,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-04 11:47:31,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:31,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-04 11:47:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-04 11:47:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 11:47:31,271 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-04 11:47:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:31,431 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-04 11:47:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-04 11:47:31,431 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-04 11:47:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:31,432 INFO L225 Difference]: With dead ends: 85 [2018-12-04 11:47:31,432 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:47:31,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 11:47:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:47:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:47:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:47:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-04 11:47:31,435 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-04 11:47:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:31,435 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-04 11:47:31,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-04 11:47:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-04 11:47:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:47:31,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:31,436 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-04 11:47:31,436 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:31,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-04 11:47:31,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:31,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:31,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:33,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:33,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:33,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:33,692 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,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:33,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:33,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:33,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:33,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:40,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-04 11:47:40,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:40,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-04 11:47:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-04 11:47:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 11:47:40,281 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-04 11:47:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:40,403 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-04 11:47:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-04 11:47:40,404 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-04 11:47:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:40,404 INFO L225 Difference]: With dead ends: 86 [2018-12-04 11:47:40,404 INFO L226 Difference]: Without dead ends: 84 [2018-12-04 11:47:40,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 11:47:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-04 11:47:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-04 11:47:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 11:47:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-04 11:47:40,408 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-04 11:47:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:40,409 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-04 11:47:40,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-04 11:47:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-04 11:47:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 11:47:40,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:40,409 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-04 11:47:40,410 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:40,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-04 11:47:40,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:42,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:42,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:42,992 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,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:43,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:43,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-04 11:47:43,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:43,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:43,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:50,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:50,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-04 11:47:50,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:50,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 11:47:50,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 11:47:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 11:47:50,487 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-04 11:47:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:50,672 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-04 11:47:50,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 11:47:50,672 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-04 11:47:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:50,672 INFO L225 Difference]: With dead ends: 87 [2018-12-04 11:47:50,673 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:47:50,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 11:47:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:47:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:47:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:47:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-04 11:47:50,676 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-04 11:47:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:50,676 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-04 11:47:50,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 11:47:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-04 11:47:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:47:50,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:50,677 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-04 11:47:50,677 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:50,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-04 11:47:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:50,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:50,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:53,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:53,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:53,036 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:53,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:53,036 INFO 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:47:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:53,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:53,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:53,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:53,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:53,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:59,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:59,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-04 11:47:59,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:59,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-04 11:47:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-04 11:47:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:00,000 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-04 11:48:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:00,168 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-04 11:48:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-04 11:48:00,168 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-04 11:48:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:00,168 INFO L225 Difference]: With dead ends: 88 [2018-12-04 11:48:00,168 INFO L226 Difference]: Without dead ends: 86 [2018-12-04 11:48:00,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-04 11:48:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-04 11:48:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-04 11:48:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-04 11:48:00,172 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-04 11:48:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:00,172 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-04 11:48:00,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-04 11:48:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-04 11:48:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-04 11:48:00,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:00,173 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-04 11:48:00,173 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:00,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-04 11:48:00,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:00,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:00,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:02,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:02,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:02,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:02,753 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:02,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:02,754 INFO 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:02,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:02,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:02,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:02,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:09,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:09,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-04 11:48:09,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:09,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-04 11:48:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-04 11:48:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 11:48:09,851 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-04 11:48:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:10,083 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-04 11:48:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-04 11:48:10,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-04 11:48:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:10,084 INFO L225 Difference]: With dead ends: 89 [2018-12-04 11:48:10,085 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:48:10,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 11:48:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:48:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:48:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:48:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-04 11:48:10,088 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-04 11:48:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:10,088 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-04 11:48:10,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-04 11:48:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-04 11:48:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:48:10,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:10,089 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-04 11:48:10,089 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:10,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-04 11:48:10,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:10,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:12,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:12,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:12,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:12,558 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:12,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:12,558 INFO 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:48:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:48:12,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:48:13,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-04 11:48:13,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:13,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:13,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-04 11:48:20,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:20,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 11:48:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 11:48:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 11:48:20,808 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-04 11:48:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:20,940 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-04 11:48:20,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 11:48:20,940 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-04 11:48:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:20,941 INFO L225 Difference]: With dead ends: 90 [2018-12-04 11:48:20,941 INFO L226 Difference]: Without dead ends: 88 [2018-12-04 11:48:20,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 11:48:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-04 11:48:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-04 11:48:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-04 11:48:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-04 11:48:20,944 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-04 11:48:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:20,944 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-04 11:48:20,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 11:48:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-04 11:48:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-04 11:48:20,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:20,945 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-04 11:48:20,945 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:20,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-04 11:48:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:20,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:20,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:23,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:23,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:23,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:23,443 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:23,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:23,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 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:48:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:23,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:23,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:23,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:23,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:23,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-04 11:48:30,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:30,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-04 11:48:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-04 11:48:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 11:48:30,883 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-04 11:48:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:31,050 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-04 11:48:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-04 11:48:31,051 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-04 11:48:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:31,051 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:48:31,051 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:48:31,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 11:48:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:48:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:48:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:48:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-04 11:48:31,055 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-04 11:48:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:31,055 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-04 11:48:31,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-04 11:48:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-04 11:48:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:48:31,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:31,056 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-04 11:48:31,056 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:31,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-04 11:48:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:31,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:31,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:33,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:33,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:33,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:33,592 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:33,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:33,592 INFO 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:48:33,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:33,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:33,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:33,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:41,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:41,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-04 11:48:41,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:41,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-04 11:48:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-04 11:48:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:48:41,189 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-04 11:48:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:41,541 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-04 11:48:41,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-04 11:48:41,541 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-04 11:48:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:41,542 INFO L225 Difference]: With dead ends: 92 [2018-12-04 11:48:41,542 INFO L226 Difference]: Without dead ends: 90 [2018-12-04 11:48:41,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:48:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-04 11:48:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-04 11:48:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-04 11:48:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-04 11:48:41,545 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-04 11:48:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:41,545 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-04 11:48:41,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-04 11:48:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-04 11:48:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-04 11:48:41,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:41,546 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-04 11:48:41,546 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:41,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-04 11:48:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:41,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:44,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:44,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:44,182 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:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:44,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48:44,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:48:44,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:48:45,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-04 11:48:45,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:45,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:45,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:53,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-04 11:48:53,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 11:48:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 11:48:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 11:48:53,074 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-04 11:48:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:53,287 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-04 11:48:53,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-04 11:48:53,287 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-04 11:48:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:53,288 INFO L225 Difference]: With dead ends: 93 [2018-12-04 11:48:53,288 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:48:53,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 11:48:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:48:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:48:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:48:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-04 11:48:53,290 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-04 11:48:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:53,291 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-04 11:48:53,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 11:48:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-04 11:48:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:48:53,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:53,291 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-04 11:48:53,291 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:53,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-04 11:48:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:53,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:53,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:53,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:53,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:56,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:56,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:56,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:56,088 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:56,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:56,089 INFO 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:48:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:56,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:56,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:56,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:56,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:56,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:04,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:04,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-04 11:49:04,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:04,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-04 11:49:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-04 11:49:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 11:49:04,006 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-04 11:49:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:04,132 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-04 11:49:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-04 11:49:04,132 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-04 11:49:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:04,133 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:49:04,133 INFO L226 Difference]: Without dead ends: 92 [2018-12-04 11:49:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 11:49:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-04 11:49:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-04 11:49:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-04 11:49:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-04 11:49:04,137 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-04 11:49:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:04,137 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-04 11:49:04,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-04 11:49:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-04 11:49:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-04 11:49:04,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:04,138 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-04 11:49:04,138 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:04,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-04 11:49:04,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:04,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:04,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:04,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:04,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:06,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:06,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:06,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:06,857 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:06,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:06,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:06,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:06,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:49:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:06,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:06,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:14,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:14,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-04 11:49:14,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:14,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 11:49:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 11:49:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 11:49:14,956 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-04 11:49:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:15,170 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-04 11:49:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 11:49:15,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-04 11:49:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:15,171 INFO L225 Difference]: With dead ends: 95 [2018-12-04 11:49:15,171 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:49:15,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 11:49:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:49:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:49:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:49:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-04 11:49:15,174 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-04 11:49:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:15,174 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-04 11:49:15,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 11:49:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-04 11:49:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:49:15,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:15,175 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-04 11:49:15,175 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:15,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:15,176 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-04 11:49:15,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:15,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:15,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:15,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:15,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:18,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:18,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:18,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:18,048 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:18,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:18,048 INFO 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:49:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:18,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:19,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-04 11:49:19,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:19,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:19,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:27,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:27,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-04 11:49:27,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:27,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 11:49:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 11:49:27,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:49:27,578 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-04 11:49:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:27,707 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-04 11:49:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-04 11:49:27,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-04 11:49:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:27,708 INFO L225 Difference]: With dead ends: 96 [2018-12-04 11:49:27,709 INFO L226 Difference]: Without dead ends: 94 [2018-12-04 11:49:27,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:49:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-04 11:49:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-04 11:49:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-04 11:49:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-04 11:49:27,712 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-04 11:49:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:27,713 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-04 11:49:27,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 11:49:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-04 11:49:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-04 11:49:27,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:27,713 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-04 11:49:27,713 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:27,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-04 11:49:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:27,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:27,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:30,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:30,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:30,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:30,563 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:30,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:30,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:49:30,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:49:30,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:49:30,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:49:30,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:30,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:30,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:39,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:39,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-04 11:49:39,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:39,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-04 11:49:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-04 11:49:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 11:49:39,103 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-04 11:49:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:39,345 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-04 11:49:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-04 11:49:39,345 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-04 11:49:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:39,346 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:49:39,346 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:49:39,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 11:49:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:49:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:49:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:49:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-04 11:49:39,350 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-04 11:49:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:39,350 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-04 11:49:39,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-04 11:49:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-04 11:49:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:49:39,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:39,351 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-04 11:49:39,351 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:39,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-04 11:49:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:39,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:39,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:42,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:42,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:42,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:42,313 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:42,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:42,313 INFO 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:49:42,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:42,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:49:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:42,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:42,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:50,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:50,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-04 11:49:50,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:50,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-04 11:49:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-04 11:49:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 11:49:50,990 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-04 11:49:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:51,172 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-04 11:49:51,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-04 11:49:51,172 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-04 11:49:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:51,173 INFO L225 Difference]: With dead ends: 98 [2018-12-04 11:49:51,173 INFO L226 Difference]: Without dead ends: 96 [2018-12-04 11:49:51,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 11:49:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-04 11:49:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-04 11:49:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-04 11:49:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-04 11:49:51,176 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-04 11:49:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:51,176 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-04 11:49:51,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-04 11:49:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-04 11:49:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-04 11:49:51,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:51,177 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-04 11:49:51,177 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:51,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-04 11:49:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:51,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:54,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:54,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:54,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:54,192 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:54,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:54,192 INFO 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:49:54,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:54,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:55,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-04 11:49:55,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:55,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:55,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-04 11:50:04,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:04,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 11:50:04,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 11:50:04,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 11:50:04,411 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-04 11:50:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:04,565 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-04 11:50:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 11:50:04,565 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-04 11:50:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:04,566 INFO L225 Difference]: With dead ends: 99 [2018-12-04 11:50:04,566 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:50:04,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 11:50:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:50:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:50:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:50:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-04 11:50:04,569 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-04 11:50:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:04,569 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-04 11:50:04,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 11:50:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-04 11:50:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:50:04,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:04,570 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-04 11:50:04,570 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:04,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-04 11:50:04,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:04,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:04,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:07,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:07,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:07,637 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:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:07,637 INFO 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:50:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:07,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:07,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:07,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:07,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:07,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:16,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:16,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-04 11:50:16,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:16,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-04 11:50:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-04 11:50:16,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:50:16,709 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-04 11:50:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:16,860 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-04 11:50:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-04 11:50:16,860 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-04 11:50:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:16,861 INFO L225 Difference]: With dead ends: 100 [2018-12-04 11:50:16,861 INFO L226 Difference]: Without dead ends: 98 [2018-12-04 11:50:16,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:50:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-04 11:50:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-04 11:50:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-04 11:50:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-04 11:50:16,864 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-04 11:50:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:16,864 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-04 11:50:16,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-04 11:50:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-04 11:50:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-04 11:50:16,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:16,865 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-04 11:50:16,865 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:16,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-04 11:50:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:16,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:16,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:19,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:19,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:19,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:19,966 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:19,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:19,966 INFO 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:50:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:19,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:50:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:20,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:20,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:29,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:29,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-04 11:50:29,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-04 11:50:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-04 11:50:29,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 11:50:29,262 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-04 11:50:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:29,414 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-04 11:50:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-04 11:50:29,414 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-04 11:50:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:29,415 INFO L225 Difference]: With dead ends: 101 [2018-12-04 11:50:29,415 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:50:29,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 11:50:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:50:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:50:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:50:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-04 11:50:29,419 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-04 11:50:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-04 11:50:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-04 11:50:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-04 11:50:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:50:29,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:29,420 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-04 11:50:29,420 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:29,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-04 11:50:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:29,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:32,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:32,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:32,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:32,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:50:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:32,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 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:50:32,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:50:32,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:50:34,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-04 11:50:34,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:34,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:34,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:43,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:43,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-04 11:50:43,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:43,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-04 11:50:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-04 11:50:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 11:50:43,604 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-04 11:50:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:43,774 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-04 11:50:43,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-04 11:50:43,775 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-04 11:50:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:43,775 INFO L225 Difference]: With dead ends: 102 [2018-12-04 11:50:43,775 INFO L226 Difference]: Without dead ends: 100 [2018-12-04 11:50:43,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 11:50:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-04 11:50:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-04 11:50:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-04 11:50:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-04 11:50:43,779 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-04 11:50:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:43,779 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-04 11:50:43,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-04 11:50:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-04 11:50:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-04 11:50:43,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:43,780 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-04 11:50:43,780 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:43,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-04 11:50:43,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:43,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:43,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:47,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:47,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:47,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:47,008 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,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:47,008 INFO 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:50:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:47,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:47,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:47,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:47,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:47,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:56,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:56,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-04 11:50:56,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:56,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-04 11:50:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-04 11:50:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 11:50:56,571 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-04 11:50:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:56,773 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-04 11:50:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 11:50:56,773 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-04 11:50:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:56,774 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:50:56,774 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:50:56,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 11:50:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:50:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:50:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:50:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-04 11:50:56,777 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-04 11:50:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:56,777 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-04 11:50:56,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-04 11:50:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-04 11:50:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:50:56,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:56,778 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-04 11:50:56,778 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:56,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-04 11:50:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:56,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:56,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:00,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:00,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:00,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:00,090 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,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:00,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:00,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:00,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:00,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:09,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:09,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-04 11:51:09,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:09,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-04 11:51:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-04 11:51:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:51:09,836 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-04 11:51:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:10,137 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-04 11:51:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-04 11:51:10,138 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-04 11:51:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:10,138 INFO L225 Difference]: With dead ends: 104 [2018-12-04 11:51:10,138 INFO L226 Difference]: Without dead ends: 102 [2018-12-04 11:51:10,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:51:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-04 11:51:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-04 11:51:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-04 11:51:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-04 11:51:10,142 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-04 11:51:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:10,142 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-04 11:51:10,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-04 11:51:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-04 11:51:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-04 11:51:10,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:10,143 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-04 11:51:10,143 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:10,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-04 11:51:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:10,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:10,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:10,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:13,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:13,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:13,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:13,537 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,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:13,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:13,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:51:13,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:51:15,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-04 11:51:15,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:15,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:15,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:25,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-04 11:51:25,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 11:51:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 11:51:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 11:51:25,249 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-04 11:51:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:25,485 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-04 11:51:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-04 11:51:25,486 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-04 11:51:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:25,486 INFO L225 Difference]: With dead ends: 105 [2018-12-04 11:51:25,486 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:51:25,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 11:51:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:51:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:51:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:51:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-04 11:51:25,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-04 11:51:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-04 11:51:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 11:51:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-04 11:51:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:51:25,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:25,492 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-04 11:51:25,492 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:25,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-04 11:51:25,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:25,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:25,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:28,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:28,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:28,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:28,973 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:28,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:28,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:28,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:51:28,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:51:29,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:51:29,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:29,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:29,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:39,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:39,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-04 11:51:39,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:39,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-04 11:51:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-04 11:51:39,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 11:51:39,202 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-04 11:51:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:39,478 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-04 11:51:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-04 11:51:39,479 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-04 11:51:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:39,479 INFO L225 Difference]: With dead ends: 106 [2018-12-04 11:51:39,479 INFO L226 Difference]: Without dead ends: 104 [2018-12-04 11:51:39,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 11:51:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-04 11:51:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-04 11:51:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-04 11:51:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-04 11:51:39,483 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-04 11:51:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:39,483 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-04 11:51:39,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-04 11:51:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-04 11:51:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-04 11:51:39,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:39,484 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-04 11:51:39,484 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:39,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-04 11:51:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:39,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:39,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:43,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:43,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:43,030 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:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:43,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:43,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:43,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:43,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:53,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:53,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-04 11:51:53,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:53,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-04 11:51:53,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-04 11:51:53,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 11:51:53,474 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-04 11:51:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:53,650 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-04 11:51:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 11:51:53,650 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-04 11:51:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:53,652 INFO L225 Difference]: With dead ends: 107 [2018-12-04 11:51:53,652 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:51:53,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 11:51:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:51:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:51:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:51:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-04 11:51:53,656 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-04 11:51:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:53,657 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-04 11:51:53,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-04 11:51:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-04 11:51:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:51:53,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:53,658 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-04 11:51:53,658 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:53,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-04 11:51:53,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:53,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:53,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:57,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:57,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:57,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:57,289 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:57,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:57,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:57,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:51:57,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:51:59,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-04 11:51:59,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:59,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:09,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:09,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-04 11:52:09,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:09,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-04 11:52:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-04 11:52:09,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:52:09,971 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-04 11:52:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:10,301 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-04 11:52:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-04 11:52:10,302 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-04 11:52:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:10,303 INFO L225 Difference]: With dead ends: 108 [2018-12-04 11:52:10,303 INFO L226 Difference]: Without dead ends: 106 [2018-12-04 11:52:10,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:52:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-04 11:52:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-04 11:52:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-04 11:52:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-04 11:52:10,307 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-04 11:52:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:10,307 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-04 11:52:10,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-04 11:52:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-04 11:52:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-04 11:52:10,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:10,308 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-04 11:52:10,308 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:10,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-04 11:52:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:10,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:10,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:10,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:10,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:13,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:13,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:13,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:13,969 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:13,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:13,970 INFO 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:52:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:52:13,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:52:14,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:52:14,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:14,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:14,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-04 11:52:24,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-04 11:52:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-04 11:52:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 11:52:24,820 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-04 11:52:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:25,123 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-04 11:52:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-04 11:52:25,124 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-04 11:52:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:25,124 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:52:25,124 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:52:25,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 11:52:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:52:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:52:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:52:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-04 11:52:25,128 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-04 11:52:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:25,128 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-04 11:52:25,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-04 11:52:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-04 11:52:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:52:25,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:25,129 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-04 11:52:25,129 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:25,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-04 11:52:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:25,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:25,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:28,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:28,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:28,891 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:28,891 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:28,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:28,892 INFO 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:52:28,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:28,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:52:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:28,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:28,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:40,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:40,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-04 11:52:40,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-04 11:52:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-04 11:52:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 11:52:40,017 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-04 11:52:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:40,251 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-04 11:52:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-04 11:52:40,252 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-04 11:52:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:40,252 INFO L225 Difference]: With dead ends: 110 [2018-12-04 11:52:40,252 INFO L226 Difference]: Without dead ends: 108 [2018-12-04 11:52:40,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 11:52:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-04 11:52:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-04 11:52:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 11:52:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-04 11:52:40,256 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-04 11:52:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:40,256 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-04 11:52:40,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-04 11:52:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-04 11:52:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 11:52:40,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:40,256 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-04 11:52:40,257 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:40,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-04 11:52:40,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:40,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:44,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:44,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:44,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:44,090 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:44,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:44,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:44,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:52:44,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:52:46,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-04 11:52:46,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:46,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:46,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:57,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:57,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-04 11:52:57,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:57,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 11:52:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 11:52:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 11:52:57,558 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-04 11:52:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:57,786 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-04 11:52:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-04 11:52:57,786 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-04 11:52:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:57,786 INFO L225 Difference]: With dead ends: 111 [2018-12-04 11:52:57,786 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:52:57,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 11:52:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:52:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:52:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:52:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-04 11:52:57,789 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-04 11:52:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:57,790 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-04 11:52:57,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 11:52:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-04 11:52:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:52:57,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:57,790 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-04 11:52:57,790 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:57,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-04 11:52:57,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:57,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:57,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:01,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:01,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:01,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:01,655 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:01,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:01,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:53:01,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:53:01,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:53:01,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:01,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:01,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-04 11:53:13,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:13,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-04 11:53:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-04 11:53:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 11:53:13,097 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-04 11:53:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:13,345 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-04 11:53:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-04 11:53:13,345 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-04 11:53:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:13,345 INFO L225 Difference]: With dead ends: 112 [2018-12-04 11:53:13,346 INFO L226 Difference]: Without dead ends: 110 [2018-12-04 11:53:13,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 11:53:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-04 11:53:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-04 11:53:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-04 11:53:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-04 11:53:13,349 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-04 11:53:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:13,349 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-04 11:53:13,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-04 11:53:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-04 11:53:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-04 11:53:13,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:13,350 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-04 11:53:13,350 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:13,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-04 11:53:13,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:13,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:13,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:17,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:17,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:17,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:17,277 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:17,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:17,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:53:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:17,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:53:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:17,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:17,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:28,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:28,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-04 11:53:28,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:28,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-04 11:53:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-04 11:53:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-04 11:53:28,978 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-04 11:53:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:29,242 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-04 11:53:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-04 11:53:29,243 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-04 11:53:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:29,243 INFO L225 Difference]: With dead ends: 113 [2018-12-04 11:53:29,243 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:53:29,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-04 11:53:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:53:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:53:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:53:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-04 11:53:29,246 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-04 11:53:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:29,247 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-04 11:53:29,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-04 11:53:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-04 11:53:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:53:29,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:29,247 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-04 11:53:29,247 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:29,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-04 11:53:29,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:29,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:29,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:29,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:29,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:33,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:33,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:33,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:33,244 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:33,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:33,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:53:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:53:33,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:53:35,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-04 11:53:35,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:35,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:35,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:47,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:47,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-04 11:53:47,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:47,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-04 11:53:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-04 11:53:47,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 11:53:47,636 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-04 11:53:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:47,967 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-04 11:53:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-04 11:53:47,967 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-04 11:53:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:47,968 INFO L225 Difference]: With dead ends: 114 [2018-12-04 11:53:47,968 INFO L226 Difference]: Without dead ends: 112 [2018-12-04 11:53:47,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 11:53:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-04 11:53:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-04 11:53:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 11:53:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-04 11:53:47,971 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-04 11:53:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:47,972 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-04 11:53:47,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-04 11:53:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-04 11:53:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 11:53:47,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:47,972 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-04 11:53:47,972 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:47,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-04 11:53:47,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:47,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:47,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:52,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:52,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:52,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:52,026 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:52,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:52,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:53:52,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:53:52,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:53:52,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:53:52,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:52,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:52,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:04,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-04 11:54:04,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-04 11:54:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-04 11:54:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-04 11:54:04,137 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-04 11:54:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:04,394 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-04 11:54:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-04 11:54:04,399 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-04 11:54:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:04,399 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:54:04,400 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 11:54:04,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-04 11:54:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 11:54:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-04 11:54:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-04 11:54:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-04 11:54:04,403 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-04 11:54:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:04,404 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-04 11:54:04,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-04 11:54:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-04 11:54:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-04 11:54:04,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:04,405 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-04 11:54:04,405 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:04,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-04 11:54:04,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:04,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:04,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:04,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:04,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:08,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:08,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:08,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:08,538 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:08,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:08,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:54:08,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:54:08,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:54:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:08,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:08,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:20,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-04 11:54:20,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:20,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-04 11:54:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-04 11:54:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 11:54:20,912 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-04 11:54:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:21,137 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-04 11:54:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-04 11:54:21,137 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-04 11:54:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:21,138 INFO L225 Difference]: With dead ends: 116 [2018-12-04 11:54:21,138 INFO L226 Difference]: Without dead ends: 114 [2018-12-04 11:54:21,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 11:54:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-04 11:54:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-04 11:54:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-04 11:54:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-04 11:54:21,142 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-04 11:54:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:21,142 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-04 11:54:21,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-04 11:54:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-04 11:54:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-04 11:54:21,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:21,143 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-04 11:54:21,143 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:21,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-04 11:54:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:54:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:21,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:25,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:25,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:25,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:25,415 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:25,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:25,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:54:25,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:54:25,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:54:28,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-04 11:54:28,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:28,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:28,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-04 11:54:40,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 11:54:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 11:54:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-04 11:54:40,736 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-04 11:54:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:41,123 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-04 11:54:41,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-04 11:54:41,123 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-04 11:54:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:41,123 INFO L225 Difference]: With dead ends: 117 [2018-12-04 11:54:41,124 INFO L226 Difference]: Without dead ends: 115 [2018-12-04 11:54:41,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-04 11:54:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-04 11:54:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-04 11:54:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-04 11:54:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-04 11:54:41,128 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-04 11:54:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:41,128 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-04 11:54:41,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 11:54:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-04 11:54:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-04 11:54:41,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:41,129 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-04 11:54:41,129 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:41,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2018-12-04 11:54:41,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:41,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:41,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:45,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:45,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:45,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:45,502 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:45,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:45,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:54:45,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:54:45,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:54:45,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:54:45,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:45,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:45,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:58,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:58,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-04 11:54:58,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:58,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-04 11:54:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-04 11:54:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-04 11:54:58,314 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-04 11:54:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:58,638 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-04 11:54:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-04 11:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-04 11:54:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:58,639 INFO L225 Difference]: With dead ends: 118 [2018-12-04 11:54:58,639 INFO L226 Difference]: Without dead ends: 116 [2018-12-04 11:54:58,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-04 11:54:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-04 11:54:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-04 11:54:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-04 11:54:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-04 11:54:58,642 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-04 11:54:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:58,643 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-04 11:54:58,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-04 11:54:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-04 11:54:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-04 11:54:58,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:58,644 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-04 11:54:58,644 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:58,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2018-12-04 11:54:58,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:58,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:58,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:03,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:03,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:03,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:03,031 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:03,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:03,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:55:03,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:55:03,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:55:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:03,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:03,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:16,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:16,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 227 [2018-12-04 11:55:16,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:16,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-04 11:55:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-04 11:55:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-04 11:55:16,129 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-12-04 11:55:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:16,337 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-04 11:55:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-04 11:55:16,338 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-12-04 11:55:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:16,338 INFO L225 Difference]: With dead ends: 119 [2018-12-04 11:55:16,338 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 11:55:16,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-04 11:55:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 11:55:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-04 11:55:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-04 11:55:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-04 11:55:16,342 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-12-04 11:55:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-04 11:55:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-04 11:55:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-04 11:55:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-04 11:55:16,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:16,343 INFO L402 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-12-04 11:55:16,343 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:16,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1605587820, now seen corresponding path program 113 times [2018-12-04 11:55:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:55:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:16,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat