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-f57a05f [2019-01-08 13:51:48,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:51:48,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:51:48,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:51:48,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:51:48,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:51:48,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:51:48,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:51:48,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:51:48,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:51:48,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:51:48,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:51:48,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:51:48,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:51:48,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:51:48,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:51:48,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:51:48,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:51:48,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:51:48,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:51:48,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:51:48,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:51:48,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:51:48,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:51:48,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:51:48,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:51:48,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:51:48,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:51:48,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:51:48,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:51:48,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:51:48,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:51:48,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:51:48,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:51:48,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:51:48,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:51:48,950 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 [2019-01-08 13:51:48,973 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:51:48,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:51:48,976 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:51:48,976 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:51:48,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:51:48,977 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:51:48,977 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:51:48,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:51:48,978 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:51:48,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:51:48,978 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:51:48,978 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:51:48,979 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:51:48,979 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:51:48,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:51:48,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:51:48,981 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:51:48,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:51:48,982 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:51:48,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:51:48,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:51:48,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:51:48,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:51:48,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:51:48,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:51:48,985 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:51:48,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:51:48,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:51:48,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:51:48,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:51:48,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:51:48,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:48,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:51:48,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:51:48,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:51:48,987 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:51:48,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:51:48,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:51:48,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:51:48,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:51:49,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:51:49,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:51:49,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:51:49,048 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:51:49,049 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:51:49,050 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 [2019-01-08 13:51:49,050 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-08 13:51:49,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:51:49,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:51:49,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:51:49,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:51:49,125 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 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,138 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 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:51:49,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:51:49,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:51:49,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:51:49,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:51:49,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:51:49,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:51:49,448 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:51:49,449 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-08 13:51:49,450 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49 BoogieIcfgContainer [2019-01-08 13:51:49,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:51:49,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:51:49,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:51:49,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:51:49,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/2) ... [2019-01-08 13:51:49,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e77855 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:51:49, skipping insertion in model container [2019-01-08 13:51:49,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49" (2/2) ... [2019-01-08 13:51:49,460 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-08 13:51:49,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:51:49,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:51:49,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:51:49,531 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:51:49,531 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:51:49,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:51:49,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:51:49,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:51:49,532 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:51:49,532 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:51:49,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:51:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-08 13:51:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 13:51:49,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 13:51:49,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-08 13:51:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:49,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 13:51:49,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:49,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:49,754 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-08 13:51:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:49,799 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-08 13:51:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:49,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 13:51:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:49,814 INFO L225 Difference]: With dead ends: 9 [2019-01-08 13:51:49,814 INFO L226 Difference]: Without dead ends: 5 [2019-01-08 13:51:49,817 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 [2019-01-08 13:51:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-08 13:51:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-08 13:51:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-08 13:51:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-08 13:51:49,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-08 13:51:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:49,854 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-08 13:51:49,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-08 13:51:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 13:51:49,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 13:51:49,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-08 13:51:49,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:49,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:49,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:49,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:49,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 13:51:49,939 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-08 13:51:49,997 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:51:49,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:51:50,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:51:50,149 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. [2019-01-08 13:51:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:51:50,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,161 INFO L193 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 [2019-01-08 13:51:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:50,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-08 13:51:50,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:50,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:50,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:50,475 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-08 13:51:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,518 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-08 13:51:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:51:50,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 13:51:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,519 INFO L225 Difference]: With dead ends: 8 [2019-01-08 13:51:50,519 INFO L226 Difference]: Without dead ends: 6 [2019-01-08 13:51:50,520 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 [2019-01-08 13:51:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-08 13:51:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-08 13:51:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-08 13:51:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-08 13:51:50,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-08 13:51:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,524 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-08 13:51:50,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-08 13:51:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 13:51:50,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,525 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 13:51:50,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-08 13:51:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:50,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:50,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,592 INFO L193 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 [2019-01-08 13:51:50,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:50,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:50,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 13:51:50,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:50,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:50,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-08 13:51:50,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:50,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 13:51:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 13:51:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:51:50,750 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-08 13:51:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,812 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-08 13:51:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:51:50,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-08 13:51:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,814 INFO L225 Difference]: With dead ends: 9 [2019-01-08 13:51:50,814 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 13:51:50,814 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 [2019-01-08 13:51:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 13:51:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 13:51:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 13:51:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-08 13:51:50,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-08 13:51:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,817 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-08 13:51:50,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 13:51:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-08 13:51:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:51:50,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,819 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-08 13:51:50,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-08 13:51:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,107 INFO L193 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 [2019-01-08 13:51:51,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:51,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:51,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:51,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:51,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 13:51:51,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 13:51:51,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 13:51:51,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,366 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-08 13:51:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,383 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-08 13:51:51,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:51:51,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-08 13:51:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,385 INFO L225 Difference]: With dead ends: 10 [2019-01-08 13:51:51,386 INFO L226 Difference]: Without dead ends: 8 [2019-01-08 13:51:51,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-08 13:51:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-08 13:51:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 13:51:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-08 13:51:51,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-08 13:51:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,390 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-08 13:51:51,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 13:51:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-08 13:51:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 13:51:51,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,391 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-08 13:51:51,391 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-08 13:51:51,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,586 INFO L193 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 [2019-01-08 13:51:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-08 13:51:51,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 13:51:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 13:51:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:51,812 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-08 13:51:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,837 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-08 13:51:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:51:51,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 13:51:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,838 INFO L225 Difference]: With dead ends: 11 [2019-01-08 13:51:51,838 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 13:51:51,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 13:51:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 13:51:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 13:51:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-08 13:51:51,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-08 13:51:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,843 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-08 13:51:51,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 13:51:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-08 13:51:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 13:51:51,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,844 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-08 13:51:51,844 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-08 13:51:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,948 INFO L193 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 [2019-01-08 13:51:51,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:51,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:52,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 13:51:52,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-08 13:51:52,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:52,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:51:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:51:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,471 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-08 13:51:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:52,503 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-08 13:51:52,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:51:52,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-08 13:51:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:52,505 INFO L225 Difference]: With dead ends: 12 [2019-01-08 13:51:52,505 INFO L226 Difference]: Without dead ends: 10 [2019-01-08 13:51:52,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-08 13:51:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-08 13:51:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 13:51:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-08 13:51:52,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-08 13:51:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:52,509 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-08 13:51:52,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:51:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-08 13:51:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:51:52,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:52,510 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-08 13:51:52,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-08 13:51:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:52,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:52,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:52,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,646 INFO L193 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 [2019-01-08 13:51:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:52,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:52,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:52,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-08 13:51:52,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:52,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 13:51:52,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 13:51:52,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:52,828 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-08 13:51:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:52,858 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-08 13:51:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 13:51:52,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-08 13:51:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:52,861 INFO L225 Difference]: With dead ends: 13 [2019-01-08 13:51:52,861 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:51:52,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:51:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-08 13:51:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 13:51:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-08 13:51:52,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-08 13:51:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:52,865 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-08 13:51:52,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 13:51:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-08 13:51:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 13:51:52,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:52,866 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-08 13:51:52,867 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-08 13:51:52,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:52,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:53,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:53,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:53,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,061 INFO L193 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 [2019-01-08 13:51:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-08 13:51:53,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 13:51:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 13:51:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,417 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-08 13:51:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,476 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-08 13:51:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:51:53,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-08 13:51:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,483 INFO L225 Difference]: With dead ends: 14 [2019-01-08 13:51:53,483 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 13:51:53,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 13:51:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-08 13:51:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 13:51:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-08 13:51:53,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-08 13:51:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,487 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-08 13:51:53,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 13:51:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-08 13:51:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-08 13:51:53,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,489 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-08 13:51:53,489 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-08 13:51:53,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:53,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:53,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:53,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,637 INFO L193 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 [2019-01-08 13:51:53,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:53,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:53,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-08 13:51:53,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:53,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-08 13:51:53,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 13:51:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 13:51:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:51:53,940 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-08 13:51:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,968 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-08 13:51:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:51:53,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-08 13:51:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,970 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:51:53,970 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 13:51:53,971 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 [2019-01-08 13:51:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 13:51:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-08 13:51:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 13:51:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-08 13:51:53,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-08 13:51:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,975 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-08 13:51:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 13:51:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-08 13:51:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 13:51:53,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,976 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-08 13:51:53,976 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,976 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-08 13:51:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,251 INFO L193 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 [2019-01-08 13:51:54,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:54,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:54,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:54,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:54,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:54,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-08 13:51:54,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:54,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 13:51:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 13:51:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:51:54,590 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-08 13:51:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:54,625 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-08 13:51:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:51:54,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-08 13:51:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:54,626 INFO L225 Difference]: With dead ends: 16 [2019-01-08 13:51:54,627 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 13:51:54,627 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 [2019-01-08 13:51:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 13:51:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-08 13:51:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 13:51:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-08 13:51:54,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-08 13:51:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:54,630 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-08 13:51:54,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 13:51:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-08 13:51:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-08 13:51:54,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:54,631 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-08 13:51:54,632 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-08 13:51:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,829 INFO L193 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 [2019-01-08 13:51:54,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:54,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-08 13:51:55,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:55,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 13:51:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 13:51:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 13:51:55,157 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-08 13:51:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:55,183 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-08 13:51:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 13:51:55,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-08 13:51:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:55,184 INFO L225 Difference]: With dead ends: 17 [2019-01-08 13:51:55,184 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 13:51:55,185 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 [2019-01-08 13:51:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 13:51:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-08 13:51:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 13:51:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-08 13:51:55,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-08 13:51:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:55,190 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-08 13:51:55,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 13:51:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-08 13:51:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-08 13:51:55,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:55,191 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-08 13:51:55,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-08 13:51:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:55,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:55,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:55,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,509 INFO L193 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 [2019-01-08 13:51:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:55,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:55,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-08 13:51:55,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:55,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:55,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-08 13:51:55,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:55,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:51:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:51:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:51:55,993 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-08 13:51:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:56,030 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-08 13:51:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 13:51:56,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-08 13:51:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:56,038 INFO L225 Difference]: With dead ends: 18 [2019-01-08 13:51:56,038 INFO L226 Difference]: Without dead ends: 16 [2019-01-08 13:51:56,038 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 [2019-01-08 13:51:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-08 13:51:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-08 13:51:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 13:51:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-08 13:51:56,041 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-08 13:51:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:56,042 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-08 13:51:56,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:51:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-08 13:51:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-08 13:51:56,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:56,042 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-08 13:51:56,043 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-08 13:51:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:56,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:56,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:56,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,199 INFO L193 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 [2019-01-08 13:51:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:56,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:56,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:56,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:56,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-08 13:51:56,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-08 13:51:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-08 13:51:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:56,515 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-08 13:51:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:56,583 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-08 13:51:56,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:51:56,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-08 13:51:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:56,584 INFO L225 Difference]: With dead ends: 19 [2019-01-08 13:51:56,585 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 13:51:56,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 13:51:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 13:51:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 13:51:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-08 13:51:56,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-08 13:51:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:56,590 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-08 13:51:56,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-08 13:51:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-08 13:51:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 13:51:56,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:56,590 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-08 13:51:56,591 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-08 13:51:56,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:56,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:56,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:56,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:56,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:56,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,763 INFO L193 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 [2019-01-08 13:51:56,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:56,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:56,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:57,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-08 13:51:57,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:57,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 13:51:57,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 13:51:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:57,376 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-08 13:51:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:57,419 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-08 13:51:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:51:57,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-08 13:51:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:57,425 INFO L225 Difference]: With dead ends: 20 [2019-01-08 13:51:57,425 INFO L226 Difference]: Without dead ends: 18 [2019-01-08 13:51:57,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-08 13:51:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-08 13:51:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 13:51:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-08 13:51:57,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-08 13:51:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:57,433 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-08 13:51:57,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 13:51:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-08 13:51:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-08 13:51:57,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:57,434 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-08 13:51:57,434 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-08 13:51:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:57,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:57,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:57,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,854 INFO L193 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 [2019-01-08 13:51:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:57,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:57,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 13:51:57,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:57,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:58,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:58,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-08 13:51:58,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:58,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 13:51:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 13:51:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:51:58,789 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-08 13:51:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:58,825 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-08 13:51:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 13:51:58,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-08 13:51:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:58,826 INFO L225 Difference]: With dead ends: 21 [2019-01-08 13:51:58,827 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 13:51:58,828 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 [2019-01-08 13:51:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 13:51:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-08 13:51:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 13:51:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-08 13:51:58,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-08 13:51:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:58,831 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-08 13:51:58,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 13:51:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-08 13:51:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 13:51:58,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:58,833 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-08 13:51:58,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-08 13:51:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:59,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:59,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:59,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,111 INFO L193 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 [2019-01-08 13:51:59,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:59,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:59,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:59,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:59,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-08 13:51:59,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:59,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 13:51:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 13:51:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:51:59,673 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-08 13:51:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:59,831 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-08 13:51:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:51:59,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-08 13:51:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:59,832 INFO L225 Difference]: With dead ends: 22 [2019-01-08 13:51:59,833 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 13:51:59,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:51:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 13:51:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-08 13:51:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 13:51:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-08 13:51:59,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-08 13:51:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-08 13:51:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 13:51:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-08 13:51:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-08 13:51:59,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:59,839 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-08 13:51:59,839 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-08 13:51:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:00,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:00,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,586 INFO L193 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 [2019-01-08 13:52:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:00,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:00,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:00,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:01,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-08 13:52:01,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-08 13:52:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-08 13:52:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:01,336 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-08 13:52:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:01,362 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-08 13:52:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:01,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-08 13:52:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:01,363 INFO L225 Difference]: With dead ends: 23 [2019-01-08 13:52:01,363 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 13:52:01,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 13:52:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-08 13:52:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 13:52:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-08 13:52:01,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-08 13:52:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:01,368 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-08 13:52:01,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-08 13:52:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-08 13:52:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 13:52:01,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:01,369 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-08 13:52:01,369 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-08 13:52:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:01,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:01,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:01,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,637 INFO L193 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 [2019-01-08 13:52:01,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:01,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:01,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-08 13:52:01,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:01,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:02,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:02,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-08 13:52:02,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:02,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 13:52:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 13:52:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:02,510 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-08 13:52:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,541 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-08 13:52:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:02,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-08 13:52:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,542 INFO L225 Difference]: With dead ends: 24 [2019-01-08 13:52:02,542 INFO L226 Difference]: Without dead ends: 22 [2019-01-08 13:52:02,543 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 [2019-01-08 13:52:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-08 13:52:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-08 13:52:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 13:52:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-08 13:52:02,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-08 13:52:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,548 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-08 13:52:02,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 13:52:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-08 13:52:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-08 13:52:02,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,549 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-08 13:52:02,549 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-08 13:52:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:03,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:03,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,473 INFO L193 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 [2019-01-08 13:52:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:03,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:03,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:03,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:03,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:03,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-08 13:52:03,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:03,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-08 13:52:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-08 13:52:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:03,980 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-08 13:52:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:04,020 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-08 13:52:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 13:52:04,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-08 13:52:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:04,022 INFO L225 Difference]: With dead ends: 25 [2019-01-08 13:52:04,022 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 13:52:04,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 13:52:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-08 13:52:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 13:52:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-08 13:52:04,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-08 13:52:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:04,027 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-08 13:52:04,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-08 13:52:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-08 13:52:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-08 13:52:04,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:04,028 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-08 13:52:04,029 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-08 13:52:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:04,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:04,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:04,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,993 INFO L193 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 [2019-01-08 13:52:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-08 13:52:05,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:05,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 13:52:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 13:52:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:05,576 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-08 13:52:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,680 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-08 13:52:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:05,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-08 13:52:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,682 INFO L225 Difference]: With dead ends: 26 [2019-01-08 13:52:05,683 INFO L226 Difference]: Without dead ends: 24 [2019-01-08 13:52:05,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-08 13:52:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-08 13:52:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 13:52:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-08 13:52:05,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-08 13:52:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,688 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-08 13:52:05,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 13:52:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-08 13:52:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-08 13:52:05,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,689 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-08 13:52:05,689 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-08 13:52:05,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:05,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:05,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,964 INFO L193 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 [2019-01-08 13:52:05,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:05,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:06,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 13:52:06,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:06,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:06,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-08 13:52:06,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:06,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 13:52:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 13:52:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:06,843 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-08 13:52:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:06,887 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-08 13:52:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 13:52:06,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-08 13:52:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:06,888 INFO L225 Difference]: With dead ends: 27 [2019-01-08 13:52:06,888 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 13:52:06,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 13:52:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-08 13:52:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 13:52:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-08 13:52:06,893 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-08 13:52:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:06,894 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-08 13:52:06,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 13:52:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-08 13:52:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 13:52:06,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,895 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-08 13:52:06,895 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-08 13:52:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:07,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:07,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:07,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,213 INFO L193 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 [2019-01-08 13:52:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:07,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:07,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:07,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:07,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:09,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-08 13:52:09,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:09,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 13:52:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 13:52:09,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:09,693 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-08 13:52:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,746 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-08 13:52:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 13:52:09,748 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-08 13:52:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,749 INFO L225 Difference]: With dead ends: 28 [2019-01-08 13:52:09,749 INFO L226 Difference]: Without dead ends: 26 [2019-01-08 13:52:09,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-08 13:52:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-08 13:52:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 13:52:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-08 13:52:09,753 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-08 13:52:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,754 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-08 13:52:09,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 13:52:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-08 13:52:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-08 13:52:09,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,755 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-08 13:52:09,755 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-08 13:52:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:10,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:10,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:10,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,086 INFO L193 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 [2019-01-08 13:52:10,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:10,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:10,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:10,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-08 13:52:10,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:10,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-08 13:52:10,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-08 13:52:10,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 13:52:10,901 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-08 13:52:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,936 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-08 13:52:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 13:52:10,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-08 13:52:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,937 INFO L225 Difference]: With dead ends: 29 [2019-01-08 13:52:10,937 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 13:52:10,938 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 [2019-01-08 13:52:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 13:52:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-08 13:52:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 13:52:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-08 13:52:10,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-08 13:52:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,943 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-08 13:52:10,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-08 13:52:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-08 13:52:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 13:52:10,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,944 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-08 13:52:10,944 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-08 13:52:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:11,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:11,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:11,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,368 INFO L193 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 [2019-01-08 13:52:11,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:11,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:11,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 13:52:11,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:11,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:12,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-08 13:52:12,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:12,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:12,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:12,210 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-08 13:52:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:12,271 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-08 13:52:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:12,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-08 13:52:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:12,272 INFO L225 Difference]: With dead ends: 30 [2019-01-08 13:52:12,273 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 13:52:12,274 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 [2019-01-08 13:52:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 13:52:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-08 13:52:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 13:52:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-08 13:52:12,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-08 13:52:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:12,278 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-08 13:52:12,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-08 13:52:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-08 13:52:12,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:12,279 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-08 13:52:12,280 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-08 13:52:12,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:12,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:12,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:12,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,862 INFO L193 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 [2019-01-08 13:52:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:12,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:12,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:12,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:12,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-08 13:52:14,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:14,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 13:52:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 13:52:14,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 13:52:14,050 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-08 13:52:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:14,114 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-08 13:52:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:14,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-08 13:52:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:14,114 INFO L225 Difference]: With dead ends: 31 [2019-01-08 13:52:14,115 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 13:52:14,116 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 [2019-01-08 13:52:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 13:52:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-08 13:52:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 13:52:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-08 13:52:14,119 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-08 13:52:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:14,119 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-08 13:52:14,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 13:52:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-08 13:52:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-08 13:52:14,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:14,121 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-08 13:52:14,121 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-08 13:52:14,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:14,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:14,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:14,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,461 INFO L193 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 [2019-01-08 13:52:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:14,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:14,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:16,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-08 13:52:16,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 13:52:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 13:52:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:16,315 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-08 13:52:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:16,434 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-08 13:52:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 13:52:16,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-08 13:52:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:16,435 INFO L225 Difference]: With dead ends: 32 [2019-01-08 13:52:16,435 INFO L226 Difference]: Without dead ends: 30 [2019-01-08 13:52:16,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-08 13:52:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-08 13:52:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 13:52:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-08 13:52:16,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-08 13:52:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:16,440 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-08 13:52:16,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 13:52:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-08 13:52:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-08 13:52:16,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:16,441 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-08 13:52:16,441 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-08 13:52:16,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:17,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:17,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:17,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,114 INFO L193 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 [2019-01-08 13:52:17,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:17,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:17,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-08 13:52:17,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:17,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:18,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-08 13:52:18,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:18,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 13:52:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 13:52:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:18,013 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-08 13:52:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:18,181 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-08 13:52:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 13:52:18,181 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-08 13:52:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:18,182 INFO L225 Difference]: With dead ends: 33 [2019-01-08 13:52:18,182 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 13:52:18,184 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 [2019-01-08 13:52:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 13:52:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 13:52:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 13:52:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-08 13:52:18,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-08 13:52:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:18,188 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-08 13:52:18,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 13:52:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-08 13:52:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 13:52:18,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:18,188 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-08 13:52:18,188 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-08 13:52:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:19,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:19,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:19,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,150 INFO L193 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 [2019-01-08 13:52:19,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:19,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:19,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:19,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:19,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-08 13:52:20,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:20,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 13:52:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 13:52:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:20,119 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-08 13:52:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:20,152 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-08 13:52:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:20,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-08 13:52:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:20,153 INFO L225 Difference]: With dead ends: 34 [2019-01-08 13:52:20,153 INFO L226 Difference]: Without dead ends: 32 [2019-01-08 13:52:20,154 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 [2019-01-08 13:52:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-08 13:52:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-08 13:52:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 13:52:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-08 13:52:20,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-08 13:52:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-08 13:52:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 13:52:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-08 13:52:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-08 13:52:20,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:20,159 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-08 13:52:20,159 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-08 13:52:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:20,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:20,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:20,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,812 INFO L193 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 [2019-01-08 13:52:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:20,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-08 13:52:21,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:21,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-08 13:52:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-08 13:52:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:21,817 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-08 13:52:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:21,913 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-08 13:52:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:52:21,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-08 13:52:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:21,914 INFO L225 Difference]: With dead ends: 35 [2019-01-08 13:52:21,914 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 13:52:21,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 13:52:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-08 13:52:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 13:52:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-08 13:52:21,918 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-08 13:52:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:21,918 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-08 13:52:21,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-08 13:52:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-08 13:52:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-08 13:52:21,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:21,919 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-08 13:52:21,919 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-08 13:52:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:21,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:21,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:21,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:22,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:22,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:22,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,491 INFO L193 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 [2019-01-08 13:52:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:22,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:22,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 13:52:22,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:22,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:23,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-08 13:52:23,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:23,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:23,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:23,596 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-08 13:52:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:23,654 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-08 13:52:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:52:23,655 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-08 13:52:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:23,655 INFO L225 Difference]: With dead ends: 36 [2019-01-08 13:52:23,655 INFO L226 Difference]: Without dead ends: 34 [2019-01-08 13:52:23,656 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 [2019-01-08 13:52:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-08 13:52:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-08 13:52:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 13:52:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-08 13:52:23,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-08 13:52:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:23,660 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-08 13:52:23,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-08 13:52:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-08 13:52:23,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:23,661 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-08 13:52:23,661 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-08 13:52:23,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:24,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:24,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:24,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,269 INFO L193 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 [2019-01-08 13:52:24,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:24,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:24,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:24,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:24,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:25,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-08 13:52:25,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-08 13:52:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-08 13:52:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:25,614 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-08 13:52:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:25,706 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-08 13:52:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 13:52:25,706 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-08 13:52:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:25,707 INFO L225 Difference]: With dead ends: 37 [2019-01-08 13:52:25,707 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 13:52:25,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 13:52:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-08 13:52:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 13:52:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-08 13:52:25,710 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-08 13:52:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:25,710 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-08 13:52:25,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-08 13:52:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-08 13:52:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 13:52:25,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:25,711 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-08 13:52:25,711 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:25,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-08 13:52:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:25,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:25,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:26,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:26,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:26,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:26,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:26,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:26,310 INFO L193 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 [2019-01-08 13:52:26,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:26,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:26,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:26,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:27,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-08 13:52:27,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:27,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 13:52:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 13:52:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:27,448 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-08 13:52:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:27,516 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-08 13:52:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:52:27,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-08 13:52:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:27,517 INFO L225 Difference]: With dead ends: 38 [2019-01-08 13:52:27,517 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 13:52:27,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 13:52:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-08 13:52:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 13:52:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-08 13:52:27,522 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-08 13:52:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:27,522 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-08 13:52:27,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 13:52:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-08 13:52:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-08 13:52:27,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:27,523 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-08 13:52:27,523 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-08 13:52:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:28,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:28,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:28,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:28,147 INFO L193 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 [2019-01-08 13:52:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:28,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:28,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-08 13:52:28,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:28,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:29,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:29,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-08 13:52:29,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-08 13:52:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-08 13:52:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:29,764 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-08 13:52:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:29,829 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-08 13:52:29,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:52:29,830 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-08 13:52:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:29,830 INFO L225 Difference]: With dead ends: 39 [2019-01-08 13:52:29,831 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 13:52:29,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 13:52:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-08 13:52:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 13:52:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-08 13:52:29,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-08 13:52:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:29,835 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-08 13:52:29,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-08 13:52:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-08 13:52:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 13:52:29,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:29,836 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-08 13:52:29,836 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-08 13:52:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:30,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:30,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,378 INFO L193 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 [2019-01-08 13:52:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:30,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:30,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:30,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:30,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-08 13:52:31,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:31,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 13:52:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 13:52:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:31,733 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-08 13:52:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:31,848 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-08 13:52:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:52:31,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-08 13:52:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:31,849 INFO L225 Difference]: With dead ends: 40 [2019-01-08 13:52:31,849 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 13:52:31,850 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 [2019-01-08 13:52:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 13:52:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-08 13:52:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 13:52:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-08 13:52:31,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-08 13:52:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:31,853 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-08 13:52:31,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 13:52:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-08 13:52:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-08 13:52:31,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:31,854 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-08 13:52:31,854 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-08 13:52:31,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:32,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:32,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:32,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:32,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:32,430 INFO L193 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 [2019-01-08 13:52:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:32,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:32,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:33,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:33,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-08 13:52:33,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:33,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-08 13:52:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-08 13:52:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 13:52:33,793 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-08 13:52:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:33,865 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-08 13:52:33,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:52:33,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-08 13:52:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:33,866 INFO L225 Difference]: With dead ends: 41 [2019-01-08 13:52:33,866 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 13:52:33,867 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 [2019-01-08 13:52:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 13:52:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-08 13:52:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 13:52:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-08 13:52:33,869 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-08 13:52:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:33,869 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-08 13:52:33,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-08 13:52:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-08 13:52:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-08 13:52:33,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:33,870 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-08 13:52:33,871 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-08 13:52:33,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:34,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:34,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:34,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:34,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:34,697 INFO L193 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 [2019-01-08 13:52:34,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:34,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:34,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-08 13:52:34,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:34,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:36,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:36,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-08 13:52:36,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:36,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:36,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:36,397 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-08 13:52:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:36,449 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-08 13:52:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 13:52:36,449 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-08 13:52:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:36,450 INFO L225 Difference]: With dead ends: 42 [2019-01-08 13:52:36,450 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 13:52:36,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 13:52:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-08 13:52:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 13:52:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-08 13:52:36,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-08 13:52:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:36,454 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-08 13:52:36,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-08 13:52:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-08 13:52:36,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:36,455 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-08 13:52:36,455 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-08 13:52:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:36,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:36,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:37,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:37,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:37,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,110 INFO L193 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 [2019-01-08 13:52:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:37,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:37,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:37,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:37,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:38,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-08 13:52:38,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:38,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-08 13:52:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-08 13:52:38,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:38,693 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-08 13:52:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:38,758 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-08 13:52:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:52:38,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-08 13:52:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:38,759 INFO L225 Difference]: With dead ends: 43 [2019-01-08 13:52:38,759 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 13:52:38,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 13:52:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-08 13:52:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 13:52:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-08 13:52:38,763 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-08 13:52:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:38,763 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-08 13:52:38,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-08 13:52:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-08 13:52:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-08 13:52:38,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:38,764 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-08 13:52:38,764 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-08 13:52:38,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:38,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:38,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:38,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:39,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:39,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:39,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,662 INFO L193 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 [2019-01-08 13:52:39,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:39,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:39,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-08 13:52:41,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:41,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 13:52:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 13:52:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:41,427 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-08 13:52:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:41,489 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-08 13:52:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:52:41,489 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-08 13:52:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:41,490 INFO L225 Difference]: With dead ends: 44 [2019-01-08 13:52:41,490 INFO L226 Difference]: Without dead ends: 42 [2019-01-08 13:52:41,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-08 13:52:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-08 13:52:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-08 13:52:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-08 13:52:41,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-08 13:52:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:41,493 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-08 13:52:41,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 13:52:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-08 13:52:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-08 13:52:41,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:41,494 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-08 13:52:41,494 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-08 13:52:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:41,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:42,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:42,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,127 INFO L193 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 [2019-01-08 13:52:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:42,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:42,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 13:52:42,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:42,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:43,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:43,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-08 13:52:43,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-08 13:52:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-08 13:52:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:43,876 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-08 13:52:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:43,941 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-08 13:52:43,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 13:52:43,941 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-08 13:52:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:43,942 INFO L225 Difference]: With dead ends: 45 [2019-01-08 13:52:43,942 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 13:52:43,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 13:52:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-08 13:52:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 13:52:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-08 13:52:43,946 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-08 13:52:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:43,946 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-08 13:52:43,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-08 13:52:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-08 13:52:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 13:52:43,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:43,947 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-08 13:52:43,947 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-08 13:52:43,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:43,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:43,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:44,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:44,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:44,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:44,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:44,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:44,952 INFO L193 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 [2019-01-08 13:52:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:44,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:44,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:44,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:44,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:44,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:46,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-08 13:52:46,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:46,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 13:52:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 13:52:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 13:52:46,723 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-08 13:52:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:46,795 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-08 13:52:46,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 13:52:46,796 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-08 13:52:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:46,796 INFO L225 Difference]: With dead ends: 46 [2019-01-08 13:52:46,796 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 13:52:46,797 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 [2019-01-08 13:52:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 13:52:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-08 13:52:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-08 13:52:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-08 13:52:46,800 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-08 13:52:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:46,800 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-08 13:52:46,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 13:52:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-08 13:52:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-08 13:52:46,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:46,801 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-08 13:52:46,801 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-08 13:52:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:46,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:46,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:47,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:47,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:47,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:47,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:47,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:47,524 INFO L193 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 [2019-01-08 13:52:47,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:47,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:47,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:47,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:49,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:49,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-08 13:52:49,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:49,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-08 13:52:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-08 13:52:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:49,766 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-08 13:52:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:49,853 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-08 13:52:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 13:52:49,854 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-08 13:52:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:49,855 INFO L225 Difference]: With dead ends: 47 [2019-01-08 13:52:49,855 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 13:52:49,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 13:52:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-08 13:52:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 13:52:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-08 13:52:49,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-08 13:52:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-08 13:52:49,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-08 13:52:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-08 13:52:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 13:52:49,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:49,858 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-08 13:52:49,858 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-08 13:52:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:49,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:49,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:50,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:50,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:50,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:50,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:50,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:50,581 INFO L193 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 [2019-01-08 13:52:50,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:50,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:50,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 13:52:50,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:50,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:50,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:52,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:52,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-08 13:52:52,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:52,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:52,565 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-08 13:52:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:52,635 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-08 13:52:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:52:52,636 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-08 13:52:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:52,636 INFO L225 Difference]: With dead ends: 48 [2019-01-08 13:52:52,636 INFO L226 Difference]: Without dead ends: 46 [2019-01-08 13:52:52,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-08 13:52:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-08 13:52:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 13:52:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-08 13:52:52,639 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-08 13:52:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:52,639 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-08 13:52:52,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-08 13:52:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-08 13:52:52,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:52,640 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-08 13:52:52,640 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-08 13:52:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:52,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:52,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:53,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:53,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:53,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:53,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:53,445 INFO L193 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 [2019-01-08 13:52:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:53,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:53,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:53,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:53,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:55,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-08 13:52:55,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:55,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-08 13:52:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-08 13:52:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:52:55,755 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-08 13:52:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:55,807 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-08 13:52:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 13:52:55,808 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-08 13:52:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:55,809 INFO L225 Difference]: With dead ends: 49 [2019-01-08 13:52:55,809 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 13:52:55,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:52:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 13:52:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-08 13:52:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 13:52:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-08 13:52:55,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-08 13:52:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:55,812 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-08 13:52:55,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-08 13:52:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-08 13:52:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 13:52:55,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:55,813 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-08 13:52:55,813 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-08 13:52:55,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:56,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:56,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:56,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:56,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,766 INFO L193 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 [2019-01-08 13:52:56,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:56,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:56,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:56,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:59,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:59,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-08 13:52:59,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:59,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 13:52:59,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 13:52:59,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:52:59,048 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-08 13:52:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:59,122 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-08 13:52:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 13:52:59,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-08 13:52:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:59,123 INFO L225 Difference]: With dead ends: 50 [2019-01-08 13:52:59,123 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 13:52:59,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:52:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 13:52:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-08 13:52:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 13:52:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-08 13:52:59,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-08 13:52:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:59,127 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-08 13:52:59,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 13:52:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-08 13:52:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-08 13:52:59,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:59,128 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-08 13:52:59,128 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:59,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-08 13:52:59,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:59,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:59,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:00,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:00,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:00,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:00,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:00,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:00,654 INFO L193 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 [2019-01-08 13:53:00,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:00,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:00,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-08 13:53:00,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:00,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:00,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:02,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:02,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-08 13:53:02,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:02,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:53:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:53:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:02,921 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-08 13:53:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:03,028 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-08 13:53:03,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:53:03,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-08 13:53:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:03,029 INFO L225 Difference]: With dead ends: 51 [2019-01-08 13:53:03,029 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 13:53:03,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 13:53:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-08 13:53:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 13:53:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-08 13:53:03,035 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-08 13:53:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:03,036 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-08 13:53:03,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:53:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-08 13:53:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 13:53:03,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:03,037 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-08 13:53:03,037 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-08 13:53:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:03,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:03,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:03,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:03,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:03,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:03,928 INFO L193 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 [2019-01-08 13:53:03,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:03,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:03,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:03,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:03,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:04,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:06,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:06,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-08 13:53:06,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:06,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 13:53:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 13:53:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:06,674 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-08 13:53:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:07,100 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-08 13:53:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:53:07,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-08 13:53:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:07,101 INFO L225 Difference]: With dead ends: 52 [2019-01-08 13:53:07,101 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 13:53:07,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 13:53:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-08 13:53:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 13:53:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-08 13:53:07,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-08 13:53:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-08 13:53:07,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 13:53:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-08 13:53:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-08 13:53:07,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:07,106 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-08 13:53:07,106 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-08 13:53:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:08,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:08,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:08,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:08,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,027 INFO L193 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 [2019-01-08 13:53:08,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:08,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:08,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:08,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:10,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:10,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-08 13:53:10,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:10,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-08 13:53:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-08 13:53:10,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:10,666 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-08 13:53:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:10,756 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-08 13:53:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 13:53:10,756 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-08 13:53:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:10,757 INFO L225 Difference]: With dead ends: 53 [2019-01-08 13:53:10,757 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 13:53:10,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 13:53:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-08 13:53:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 13:53:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-08 13:53:10,760 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-08 13:53:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:10,761 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-08 13:53:10,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-08 13:53:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-08 13:53:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-08 13:53:10,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:10,762 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-08 13:53:10,762 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-08 13:53:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:10,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:10,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:11,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:11,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:11,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:11,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:11,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:11,715 INFO L193 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 [2019-01-08 13:53:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:11,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:11,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 13:53:11,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:11,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:11,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-08 13:53:14,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:14,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:53:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:53:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:14,491 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-08 13:53:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:14,548 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-08 13:53:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:53:14,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-08 13:53:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:14,549 INFO L225 Difference]: With dead ends: 54 [2019-01-08 13:53:14,549 INFO L226 Difference]: Without dead ends: 52 [2019-01-08 13:53:14,550 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 [2019-01-08 13:53:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-08 13:53:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-08 13:53:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 13:53:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-08 13:53:14,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-08 13:53:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:14,553 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-08 13:53:14,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:53:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-08 13:53:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 13:53:14,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:14,554 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-08 13:53:14,554 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-08 13:53:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:14,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:14,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:15,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:15,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:15,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:15,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:15,761 INFO L193 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 [2019-01-08 13:53:15,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:15,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:15,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:15,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:15,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:15,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-08 13:53:18,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-08 13:53:18,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-08 13:53:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:18,286 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-08 13:53:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:18,417 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-08 13:53:18,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 13:53:18,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-08 13:53:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:18,419 INFO L225 Difference]: With dead ends: 55 [2019-01-08 13:53:18,419 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 13:53:18,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 13:53:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-08 13:53:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 13:53:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-08 13:53:18,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-08 13:53:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:18,422 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-08 13:53:18,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-08 13:53:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-08 13:53:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-08 13:53:18,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:18,423 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-08 13:53:18,423 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:18,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-08 13:53:18,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:18,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:18,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:19,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:19,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:19,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:19,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:19,492 INFO L193 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 [2019-01-08 13:53:19,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:19,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:19,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:19,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:22,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:22,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-08 13:53:22,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:22,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 13:53:22,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 13:53:22,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:53:22,675 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-08 13:53:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:22,732 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-08 13:53:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:53:22,733 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-08 13:53:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:22,733 INFO L225 Difference]: With dead ends: 56 [2019-01-08 13:53:22,734 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 13:53:22,735 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 [2019-01-08 13:53:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 13:53:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-08 13:53:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 13:53:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-08 13:53:22,736 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-08 13:53:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:22,737 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-08 13:53:22,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 13:53:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-08 13:53:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-08 13:53:22,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:22,737 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-08 13:53:22,737 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-08 13:53:22,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:22,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:23,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:23,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:23,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,742 INFO L193 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 [2019-01-08 13:53:23,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:23,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:23,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-08 13:53:23,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:23,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-08 13:53:27,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:27,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 13:53:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 13:53:27,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:27,205 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-08 13:53:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:27,376 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-08 13:53:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 13:53:27,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-08 13:53:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:27,378 INFO L225 Difference]: With dead ends: 57 [2019-01-08 13:53:27,378 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 13:53:27,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 13:53:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-08 13:53:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 13:53:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-08 13:53:27,380 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-08 13:53:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:27,380 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-08 13:53:27,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 13:53:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-08 13:53:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 13:53:27,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:27,381 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-08 13:53:27,381 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:27,382 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-08 13:53:27,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:27,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:27,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:28,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:28,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:28,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:28,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:28,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:28,457 INFO L193 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 [2019-01-08 13:53:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:28,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:28,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:28,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:28,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:28,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-08 13:53:31,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:31,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 13:53:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 13:53:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:31,608 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-08 13:53:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:31,703 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-08 13:53:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:53:31,704 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-08 13:53:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:31,705 INFO L225 Difference]: With dead ends: 58 [2019-01-08 13:53:31,705 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 13:53:31,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 13:53:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-08 13:53:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-08 13:53:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-08 13:53:31,708 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-08 13:53:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:31,708 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-08 13:53:31,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 13:53:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-08 13:53:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-08 13:53:31,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:31,709 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-08 13:53:31,710 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-08 13:53:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:31,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:31,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:32,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:32,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:32,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:32,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:32,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:32,876 INFO L193 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 [2019-01-08 13:53:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:32,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:32,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:32,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:36,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:36,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-08 13:53:36,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:36,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 13:53:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 13:53:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:36,094 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-08 13:53:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:36,189 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-08 13:53:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:53:36,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-08 13:53:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:36,190 INFO L225 Difference]: With dead ends: 59 [2019-01-08 13:53:36,191 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 13:53:36,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 13:53:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-08 13:53:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 13:53:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-08 13:53:36,193 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-08 13:53:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:36,194 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-08 13:53:36,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 13:53:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-08 13:53:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 13:53:36,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:36,195 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-08 13:53:36,195 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:36,195 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-08 13:53:36,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:36,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:37,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:37,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:37,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:37,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:37,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:37,357 INFO L193 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 [2019-01-08 13:53:37,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:37,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:37,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-08 13:53:37,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:37,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:37,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:41,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:41,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-08 13:53:41,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 13:53:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 13:53:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:41,074 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-08 13:53:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:41,146 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-08 13:53:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 13:53:41,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-08 13:53:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:41,148 INFO L225 Difference]: With dead ends: 60 [2019-01-08 13:53:41,148 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 13:53:41,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 13:53:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-08 13:53:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-08 13:53:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-08 13:53:41,151 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-08 13:53:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:41,151 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-08 13:53:41,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 13:53:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-08 13:53:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-08 13:53:41,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:41,152 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-08 13:53:41,152 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-08 13:53:41,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:41,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:41,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:42,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:42,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:42,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:42,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:42,301 INFO L193 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 [2019-01-08 13:53:42,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:42,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:42,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:42,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:42,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-08 13:53:45,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:45,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-08 13:53:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-08 13:53:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:53:45,474 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-08 13:53:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:45,566 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-08 13:53:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 13:53:45,567 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-08 13:53:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:45,567 INFO L225 Difference]: With dead ends: 61 [2019-01-08 13:53:45,568 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 13:53:45,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:53:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 13:53:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-08 13:53:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 13:53:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-08 13:53:45,571 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-08 13:53:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:45,571 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-08 13:53:45,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-08 13:53:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-08 13:53:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 13:53:45,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:45,572 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-08 13:53:45,572 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-08 13:53:45,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:45,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:45,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:46,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:46,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:46,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:46,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:46,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:46,972 INFO L193 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 [2019-01-08 13:53:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:46,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:47,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:47,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-08 13:53:50,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 13:53:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 13:53:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:53:50,300 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-08 13:53:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:50,412 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-08 13:53:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:53:50,412 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-08 13:53:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:50,413 INFO L225 Difference]: With dead ends: 62 [2019-01-08 13:53:50,413 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 13:53:50,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:53:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 13:53:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-08 13:53:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-08 13:53:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-08 13:53:50,416 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-08 13:53:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:50,417 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-08 13:53:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 13:53:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-08 13:53:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-08 13:53:50,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:50,417 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-08 13:53:50,417 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-08 13:53:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:50,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:51,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:51,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:51,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:51,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:51,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:51,920 INFO L193 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 [2019-01-08 13:53:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:51,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:52,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 13:53:52,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:52,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:52,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-08 13:53:55,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 13:53:55,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 13:53:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:55,538 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-08 13:53:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:55,613 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-08 13:53:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:53:55,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-08 13:53:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:55,615 INFO L225 Difference]: With dead ends: 63 [2019-01-08 13:53:55,615 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 13:53:55,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 13:53:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-08 13:53:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 13:53:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-08 13:53:55,619 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-08 13:53:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:55,620 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-08 13:53:55,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 13:53:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-08 13:53:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 13:53:55,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:55,620 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-08 13:53:55,621 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-08 13:53:55,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:55,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:55,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:57,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:57,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:57,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:57,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:57,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:57,005 INFO L193 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 [2019-01-08 13:53:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:57,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:57,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:57,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:57,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:57,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:00,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:00,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-08 13:54:00,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:00,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 13:54:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 13:54:00,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:54:00,557 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-08 13:54:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:00,655 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-08 13:54:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:54:00,655 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-08 13:54:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:00,656 INFO L225 Difference]: With dead ends: 64 [2019-01-08 13:54:00,656 INFO L226 Difference]: Without dead ends: 62 [2019-01-08 13:54:00,657 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 [2019-01-08 13:54:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-08 13:54:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-08 13:54:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-08 13:54:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-08 13:54:00,658 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-08 13:54:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:00,659 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-08 13:54:00,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 13:54:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-08 13:54:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-08 13:54:00,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:00,659 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-08 13:54:00,659 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:00,660 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-08 13:54:00,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:00,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:00,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:02,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:02,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:02,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:02,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:02,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:02,188 INFO L193 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 [2019-01-08 13:54:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:02,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:02,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:02,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:06,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-08 13:54:06,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:06,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-08 13:54:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-08 13:54:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:06,003 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-08 13:54:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:06,126 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-08 13:54:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 13:54:06,126 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-08 13:54:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:06,127 INFO L225 Difference]: With dead ends: 65 [2019-01-08 13:54:06,127 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 13:54:06,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 13:54:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-08 13:54:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 13:54:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-08 13:54:06,130 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-08 13:54:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:06,131 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-08 13:54:06,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-08 13:54:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-08 13:54:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 13:54:06,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:06,131 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-08 13:54:06,131 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-08 13:54:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:06,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:06,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:11,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:11,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:11,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:11,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:11,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:11,000 INFO L193 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 [2019-01-08 13:54:11,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:11,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:11,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-08 13:54:11,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:11,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:11,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:15,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-08 13:54:15,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:15,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 13:54:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 13:54:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:15,363 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-08 13:54:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:15,441 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-08 13:54:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:54:15,441 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-08 13:54:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:15,441 INFO L225 Difference]: With dead ends: 66 [2019-01-08 13:54:15,442 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 13:54:15,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 13:54:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-08 13:54:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-08 13:54:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-08 13:54:15,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-08 13:54:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:15,445 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-08 13:54:15,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 13:54:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-08 13:54:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-08 13:54:15,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:15,445 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-08 13:54:15,446 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-08 13:54:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:15,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:15,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:17,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:17,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:17,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:17,165 INFO L193 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 [2019-01-08 13:54:17,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:17,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:17,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:17,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:17,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:17,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:21,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-08 13:54:21,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:21,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-08 13:54:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-08 13:54:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 13:54:21,058 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-08 13:54:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:21,165 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-08 13:54:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:54:21,165 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-08 13:54:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:21,166 INFO L225 Difference]: With dead ends: 67 [2019-01-08 13:54:21,166 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 13:54:21,166 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 [2019-01-08 13:54:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 13:54:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-08 13:54:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-08 13:54:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-08 13:54:21,168 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-08 13:54:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:21,168 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-08 13:54:21,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-08 13:54:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-08 13:54:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-08 13:54:21,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:21,169 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-08 13:54:21,169 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-08 13:54:21,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:21,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:21,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:22,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:22,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:22,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:22,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:22,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:22,871 INFO L193 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 [2019-01-08 13:54:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:22,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:22,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:22,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:27,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-08 13:54:27,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:27,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 13:54:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 13:54:27,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:27,357 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-08 13:54:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:27,467 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-08 13:54:27,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:54:27,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-08 13:54:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:27,468 INFO L225 Difference]: With dead ends: 68 [2019-01-08 13:54:27,468 INFO L226 Difference]: Without dead ends: 66 [2019-01-08 13:54:27,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-08 13:54:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-08 13:54:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 13:54:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-08 13:54:27,470 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-08 13:54:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:27,471 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-08 13:54:27,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 13:54:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-08 13:54:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-08 13:54:27,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:27,472 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-08 13:54:27,472 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-08 13:54:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:29,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:29,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:29,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:29,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,395 INFO L193 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 [2019-01-08 13:54:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:29,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:29,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 13:54:29,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:29,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:29,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:34,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:34,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-08 13:54:34,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:34,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 13:54:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 13:54:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:34,269 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-08 13:54:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:34,389 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-08 13:54:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 13:54:34,390 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-08 13:54:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:34,391 INFO L225 Difference]: With dead ends: 69 [2019-01-08 13:54:34,391 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 13:54:34,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 13:54:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-08 13:54:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 13:54:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-08 13:54:34,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-08 13:54:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:34,395 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-08 13:54:34,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 13:54:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-08 13:54:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 13:54:34,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:34,396 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-08 13:54:34,396 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-08 13:54:34,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:34,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:34,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:34,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:36,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:36,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,536 INFO L193 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 [2019-01-08 13:54:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:36,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:36,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:36,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:36,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:36,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-08 13:54:41,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 13:54:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 13:54:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:54:41,136 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-08 13:54:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:41,262 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-08 13:54:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 13:54:41,267 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-08 13:54:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:41,268 INFO L225 Difference]: With dead ends: 70 [2019-01-08 13:54:41,268 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 13:54:41,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:54:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 13:54:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-08 13:54:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-08 13:54:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-08 13:54:41,272 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-08 13:54:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:41,272 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-08 13:54:41,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 13:54:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-08 13:54:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-08 13:54:41,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:41,273 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-08 13:54:41,274 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-08 13:54:41,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:41,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:41,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:43,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:43,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:43,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:43,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:43,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:43,071 INFO L193 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 [2019-01-08 13:54:43,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:43,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:43,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:43,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-08 13:54:49,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-08 13:54:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-08 13:54:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:54:49,266 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-08 13:54:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:49,346 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-08 13:54:49,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:54:49,346 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-08 13:54:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:49,347 INFO L225 Difference]: With dead ends: 71 [2019-01-08 13:54:49,347 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 13:54:49,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:54:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 13:54:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-08 13:54:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 13:54:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-08 13:54:49,351 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-08 13:54:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:49,351 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-08 13:54:49,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-08 13:54:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-08 13:54:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-08 13:54:49,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:49,352 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-08 13:54:49,353 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-08 13:54:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:49,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:51,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:51,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:51,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:51,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:51,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:51,671 INFO L193 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 [2019-01-08 13:54:51,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:51,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:52,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 13:54:52,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:52,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:52,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:56,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:56,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-08 13:54:56,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:56,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 13:54:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 13:54:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:56,689 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-08 13:54:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:56,794 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-08 13:54:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:54:56,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-08 13:54:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:56,795 INFO L225 Difference]: With dead ends: 72 [2019-01-08 13:54:56,796 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 13:54:56,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 13:54:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-08 13:54:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-08 13:54:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-08 13:54:56,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-08 13:54:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:56,800 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-08 13:54:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 13:54:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-08 13:54:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-08 13:54:56,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:56,800 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-08 13:54:56,801 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-08 13:54:56,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:56,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:56,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:56,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:56,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:58,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:58,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:58,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:58,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:58,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:58,743 INFO L193 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 [2019-01-08 13:54:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:58,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:58,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:58,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:58,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:58,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:03,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:03,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-08 13:55:03,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-08 13:55:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-08 13:55:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:03,737 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-08 13:55:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:04,048 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-08 13:55:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 13:55:04,048 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-08 13:55:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:04,049 INFO L225 Difference]: With dead ends: 73 [2019-01-08 13:55:04,049 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 13:55:04,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 13:55:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-08 13:55:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 13:55:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-08 13:55:04,052 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-08 13:55:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:04,053 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-08 13:55:04,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-08 13:55:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-08 13:55:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-08 13:55:04,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:04,054 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-08 13:55:04,054 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-08 13:55:04,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:04,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:04,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:05,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:05,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:05,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:05,769 INFO L193 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 [2019-01-08 13:55:05,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:05,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:05,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:05,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-08 13:55:10,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:10,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 13:55:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 13:55:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:10,938 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-08 13:55:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:11,033 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-08 13:55:11,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 13:55:11,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-08 13:55:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:11,034 INFO L225 Difference]: With dead ends: 74 [2019-01-08 13:55:11,034 INFO L226 Difference]: Without dead ends: 72 [2019-01-08 13:55:11,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-08 13:55:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-08 13:55:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-08 13:55:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-08 13:55:11,038 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-08 13:55:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:11,038 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-08 13:55:11,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 13:55:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-08 13:55:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-08 13:55:11,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:11,038 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-08 13:55:11,039 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-08 13:55:11,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:11,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:11,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:13,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:13,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:13,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:13,005 INFO L193 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 [2019-01-08 13:55:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:13,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:13,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-08 13:55:13,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:13,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:13,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:18,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-08 13:55:18,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:18,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 13:55:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 13:55:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:18,760 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-08 13:55:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:18,945 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-08 13:55:18,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 13:55:18,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-08 13:55:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:18,946 INFO L225 Difference]: With dead ends: 75 [2019-01-08 13:55:18,946 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 13:55:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 13:55:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-08 13:55:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 13:55:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-08 13:55:18,948 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-08 13:55:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:18,949 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-08 13:55:18,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 13:55:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-08 13:55:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 13:55:18,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:18,950 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-08 13:55:18,950 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-08 13:55:18,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:18,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:18,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:20,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:20,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:20,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:20,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:20,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:20,704 INFO L193 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 [2019-01-08 13:55:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:20,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:20,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:20,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:20,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:20,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:26,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:26,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-08 13:55:26,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:26,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 13:55:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 13:55:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:26,187 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-08 13:55:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:26,337 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-08 13:55:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:55:26,338 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-08 13:55:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:26,338 INFO L225 Difference]: With dead ends: 76 [2019-01-08 13:55:26,338 INFO L226 Difference]: Without dead ends: 74 [2019-01-08 13:55:26,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-08 13:55:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-08 13:55:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 13:55:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-08 13:55:26,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-08 13:55:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:26,342 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-08 13:55:26,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 13:55:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-08 13:55:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-08 13:55:26,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:26,343 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-08 13:55:26,343 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-08 13:55:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:26,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:26,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:26,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:28,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:28,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:28,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:28,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:28,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:28,402 INFO L193 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 [2019-01-08 13:55:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:28,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:28,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:28,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-08 13:55:34,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:34,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-08 13:55:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-08 13:55:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:55:34,026 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-08 13:55:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:34,189 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-08 13:55:34,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 13:55:34,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-08 13:55:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:34,191 INFO L225 Difference]: With dead ends: 77 [2019-01-08 13:55:34,191 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 13:55:34,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:55:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 13:55:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-08 13:55:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 13:55:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-08 13:55:34,194 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-08 13:55:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:34,195 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-08 13:55:34,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-08 13:55:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-08 13:55:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-08 13:55:34,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:34,196 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-08 13:55:34,196 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-08 13:55:34,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:34,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:34,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:36,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:36,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:36,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:36,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:36,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:36,100 INFO L193 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 [2019-01-08 13:55:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:36,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:36,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-08 13:55:36,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:36,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:36,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:42,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-08 13:55:42,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:42,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:55:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:55:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:55:42,452 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-08 13:55:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:42,600 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-08 13:55:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 13:55:42,600 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-08 13:55:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:42,601 INFO L225 Difference]: With dead ends: 78 [2019-01-08 13:55:42,601 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 13:55:42,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:55:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 13:55:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-08 13:55:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 13:55:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-08 13:55:42,605 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-08 13:55:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:42,606 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-08 13:55:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:55:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-08 13:55:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-08 13:55:42,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:42,607 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-08 13:55:42,607 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-08 13:55:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:42,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:42,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:44,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:44,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:44,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:44,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:44,848 INFO L193 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 [2019-01-08 13:55:44,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:44,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:44,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:44,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:44,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:44,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:50,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-08 13:55:50,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:50,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 13:55:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 13:55:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:55:50,834 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-08 13:55:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:50,977 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-08 13:55:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 13:55:50,977 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-08 13:55:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:50,978 INFO L225 Difference]: With dead ends: 79 [2019-01-08 13:55:50,978 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 13:55:50,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:55:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 13:55:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-08 13:55:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 13:55:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-08 13:55:50,981 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-08 13:55:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:50,982 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-08 13:55:50,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 13:55:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-08 13:55:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 13:55:50,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:50,983 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-08 13:55:50,983 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-08 13:55:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:50,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:50,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:52,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:52,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:52,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:52,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:52,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:52,953 INFO L193 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 [2019-01-08 13:55:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:52,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:53,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:53,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:59,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:59,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-08 13:55:59,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 13:55:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 13:55:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:55:59,372 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-08 13:55:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:59,516 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-08 13:55:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 13:55:59,516 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-08 13:55:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:59,517 INFO L225 Difference]: With dead ends: 80 [2019-01-08 13:55:59,517 INFO L226 Difference]: Without dead ends: 78 [2019-01-08 13:55:59,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:55:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-08 13:55:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-08 13:55:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 13:55:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-08 13:55:59,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-08 13:55:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:59,520 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-08 13:55:59,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 13:55:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-08 13:55:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-08 13:55:59,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:59,520 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-08 13:55:59,521 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-08 13:55:59,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:59,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:01,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:01,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:01,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:01,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:01,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:01,535 INFO L193 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 [2019-01-08 13:56:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:01,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:02,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 13:56:02,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:02,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:02,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:08,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:08,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-08 13:56:08,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:08,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 13:56:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 13:56:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:08,386 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-08 13:56:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:08,490 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-08 13:56:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 13:56:08,490 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-08 13:56:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:08,491 INFO L225 Difference]: With dead ends: 81 [2019-01-08 13:56:08,491 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 13:56:08,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 13:56:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-08 13:56:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 13:56:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-08 13:56:08,495 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-08 13:56:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:08,495 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-08 13:56:08,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 13:56:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-08 13:56:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 13:56:08,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:08,496 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-08 13:56:08,496 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-08 13:56:08,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:08,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:08,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:08,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:10,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:10,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:10,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:10,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:10,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:10,929 INFO L193 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 [2019-01-08 13:56:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:10,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:10,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:10,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:10,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:11,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-08 13:56:17,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:17,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 13:56:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 13:56:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:17,360 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-08 13:56:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:17,475 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-08 13:56:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 13:56:17,475 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-08 13:56:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:17,476 INFO L225 Difference]: With dead ends: 82 [2019-01-08 13:56:17,476 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 13:56:17,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 13:56:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-08 13:56:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-08 13:56:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-08 13:56:17,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-08 13:56:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:17,481 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-08 13:56:17,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 13:56:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-08 13:56:17,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-08 13:56:17,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:17,482 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-08 13:56:17,482 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-08 13:56:17,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:17,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:17,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:19,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:19,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:19,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:19,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:19,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:19,847 INFO L193 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 [2019-01-08 13:56:19,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:19,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:19,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:19,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-08 13:56:26,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:26,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-08 13:56:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-08 13:56:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:56:26,510 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-08 13:56:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:27,362 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-08 13:56:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 13:56:27,362 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-08 13:56:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:27,363 INFO L225 Difference]: With dead ends: 83 [2019-01-08 13:56:27,363 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 13:56:27,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:56:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 13:56:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-08 13:56:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 13:56:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-08 13:56:27,366 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-08 13:56:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:27,367 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-08 13:56:27,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-08 13:56:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-08 13:56:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-08 13:56:27,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:27,368 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-08 13:56:27,368 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-08 13:56:27,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:27,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:27,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:30,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:30,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:30,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:30,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:30,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:30,224 INFO L193 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 [2019-01-08 13:56:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:30,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:31,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-08 13:56:31,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:31,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:31,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:38,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:38,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-08 13:56:38,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:38,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:56:38,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:56:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:38,179 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-08 13:56:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:38,801 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-08 13:56:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 13:56:38,802 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-08 13:56:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:38,803 INFO L225 Difference]: With dead ends: 84 [2019-01-08 13:56:38,803 INFO L226 Difference]: Without dead ends: 82 [2019-01-08 13:56:38,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-08 13:56:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-08 13:56:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-08 13:56:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-08 13:56:38,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-08 13:56:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:38,807 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-08 13:56:38,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:56:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-08 13:56:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-08 13:56:38,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:38,808 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-08 13:56:38,808 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-08 13:56:38,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:38,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:38,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:41,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:41,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:41,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:41,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:41,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:41,356 INFO L193 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 [2019-01-08 13:56:41,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:41,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:41,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:41,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:41,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:41,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-08 13:56:48,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:48,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-08 13:56:48,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-08 13:56:48,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:48,306 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-08 13:56:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:48,449 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-08 13:56:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 13:56:48,449 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-08 13:56:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:48,450 INFO L225 Difference]: With dead ends: 85 [2019-01-08 13:56:48,450 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 13:56:48,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 13:56:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-08 13:56:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-08 13:56:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-08 13:56:48,454 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-08 13:56:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:48,454 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-08 13:56:48,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-08 13:56:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-08 13:56:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-08 13:56:48,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:48,455 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-08 13:56:48,455 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-08 13:56:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:48,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:48,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:51,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:51,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:51,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:51,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:51,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:51,095 INFO L193 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 [2019-01-08 13:56:51,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:51,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:51,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:51,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:58,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:58,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-08 13:56:58,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:58,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 13:56:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 13:56:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:58,219 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-08 13:56:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:58,334 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-08 13:56:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 13:56:58,335 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-08 13:56:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:58,336 INFO L225 Difference]: With dead ends: 86 [2019-01-08 13:56:58,336 INFO L226 Difference]: Without dead ends: 84 [2019-01-08 13:56:58,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-08 13:56:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-08 13:56:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 13:56:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-08 13:56:58,340 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-08 13:56:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:58,341 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-08 13:56:58,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 13:56:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-08 13:56:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-08 13:56:58,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:58,342 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-08 13:56:58,342 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-08 13:56:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:58,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:01,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:01,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:01,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:01,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:01,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:01,086 INFO L193 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 [2019-01-08 13:57:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:01,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:01,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-08 13:57:01,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:01,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:01,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:09,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:09,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-08 13:57:09,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:09,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 13:57:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 13:57:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:09,171 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-08 13:57:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:09,357 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-08 13:57:09,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 13:57:09,358 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-08 13:57:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:09,358 INFO L225 Difference]: With dead ends: 87 [2019-01-08 13:57:09,358 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 13:57:09,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 13:57:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-08 13:57:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 13:57:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-08 13:57:09,361 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-08 13:57:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:09,361 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-08 13:57:09,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 13:57:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-08 13:57:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 13:57:09,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:09,362 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-08 13:57:09,362 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-08 13:57:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:12,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:12,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:12,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:12,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:12,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:12,594 INFO L193 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 [2019-01-08 13:57:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:12,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:12,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:12,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:12,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:12,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:19,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-08 13:57:19,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:19,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 13:57:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 13:57:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:19,893 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-08 13:57:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:20,070 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-08 13:57:20,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 13:57:20,070 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-08 13:57:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:20,071 INFO L225 Difference]: With dead ends: 88 [2019-01-08 13:57:20,071 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 13:57:20,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 13:57:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-08 13:57:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-08 13:57:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-08 13:57:20,074 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-08 13:57:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:20,074 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-08 13:57:20,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 13:57:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-08 13:57:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-08 13:57:20,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:20,074 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-08 13:57:20,075 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-08 13:57:20,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:20,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:20,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:20,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:22,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:22,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:22,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:22,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:22,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:22,917 INFO L193 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 [2019-01-08 13:57:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:22,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:22,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:22,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:30,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:30,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-08 13:57:30,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:30,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-08 13:57:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-08 13:57:30,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:30,414 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-08 13:57:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:30,554 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-08 13:57:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 13:57:30,555 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-08 13:57:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:30,555 INFO L225 Difference]: With dead ends: 89 [2019-01-08 13:57:30,555 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 13:57:30,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 13:57:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-08 13:57:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 13:57:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-08 13:57:30,558 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-08 13:57:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:30,558 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-08 13:57:30,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-08 13:57:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-08 13:57:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 13:57:30,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:30,559 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-08 13:57:30,559 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-08 13:57:30,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:30,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:30,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:33,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:33,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:33,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:33,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:33,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:33,430 INFO L193 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 [2019-01-08 13:57:33,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:33,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:34,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-08 13:57:34,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:34,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:34,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:42,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:42,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-08 13:57:42,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:42,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:57:42,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:57:42,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:57:42,402 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-08 13:57:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:42,541 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-08 13:57:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 13:57:42,541 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-08 13:57:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:42,542 INFO L225 Difference]: With dead ends: 90 [2019-01-08 13:57:42,542 INFO L226 Difference]: Without dead ends: 88 [2019-01-08 13:57:42,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:57:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-08 13:57:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-08 13:57:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-08 13:57:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-08 13:57:42,545 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-08 13:57:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:42,545 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-08 13:57:42,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:57:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-08 13:57:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-08 13:57:42,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:42,546 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-08 13:57:42,546 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:42,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-08 13:57:42,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:42,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:42,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:42,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:45,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:45,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:45,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:45,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:45,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:45,119 INFO L193 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 [2019-01-08 13:57:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:45,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:45,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:45,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:45,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:45,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:53,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:53,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-08 13:57:53,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:53,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-08 13:57:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-08 13:57:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:57:53,159 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-08 13:57:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:53,310 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-08 13:57:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 13:57:53,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-08 13:57:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:53,311 INFO L225 Difference]: With dead ends: 91 [2019-01-08 13:57:53,311 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 13:57:53,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:57:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 13:57:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-08 13:57:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-08 13:57:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-08 13:57:53,314 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-08 13:57:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:53,315 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-08 13:57:53,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-08 13:57:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-08 13:57:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-08 13:57:53,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:53,316 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-08 13:57:53,316 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-08 13:57:53,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:53,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:53,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:56,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:56,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:56,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:56,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:56,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:56,033 INFO L193 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 [2019-01-08 13:57:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:56,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:56,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:56,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:04,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:04,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-08 13:58:04,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:04,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 13:58:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 13:58:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:58:04,368 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-08 13:58:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:04,727 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-08 13:58:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 13:58:04,728 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-08 13:58:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:04,728 INFO L225 Difference]: With dead ends: 92 [2019-01-08 13:58:04,729 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 13:58:04,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:58:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 13:58:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-08 13:58:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-08 13:58:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-08 13:58:04,732 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-08 13:58:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:04,732 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-08 13:58:04,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 13:58:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-08 13:58:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-08 13:58:04,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:04,733 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-08 13:58:04,733 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-08 13:58:04,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:07,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:07,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:07,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:07,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,726 INFO L193 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 [2019-01-08 13:58:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:07,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:08,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-08 13:58:08,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:08,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:08,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:17,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:17,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-08 13:58:17,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:17,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 13:58:17,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 13:58:17,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:58:17,319 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-08 13:58:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:17,544 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-08 13:58:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-08 13:58:17,544 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-08 13:58:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:17,544 INFO L225 Difference]: With dead ends: 93 [2019-01-08 13:58:17,545 INFO L226 Difference]: Without dead ends: 91 [2019-01-08 13:58:17,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:58:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-08 13:58:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-08 13:58:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 13:58:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-08 13:58:17,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-08 13:58:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:17,548 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-08 13:58:17,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 13:58:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-08 13:58:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 13:58:17,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:17,549 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-08 13:58:17,549 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-08 13:58:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:17,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:20,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:20,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:20,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:20,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:20,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:20,482 INFO L193 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 [2019-01-08 13:58:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:20,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:20,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:20,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:20,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:20,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:29,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:29,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-08 13:58:29,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:29,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 13:58:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 13:58:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:58:29,067 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-08 13:58:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:29,194 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-08 13:58:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-08 13:58:29,195 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-08 13:58:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:29,196 INFO L225 Difference]: With dead ends: 94 [2019-01-08 13:58:29,196 INFO L226 Difference]: Without dead ends: 92 [2019-01-08 13:58:29,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:58:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-08 13:58:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-08 13:58:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-08 13:58:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-08 13:58:29,198 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-08 13:58:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:29,199 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-08 13:58:29,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 13:58:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-08 13:58:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-08 13:58:29,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:29,199 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-08 13:58:29,199 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-08 13:58:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:31,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:31,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:31,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:31,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:31,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:31,998 INFO L193 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 [2019-01-08 13:58:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:32,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:32,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:32,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:40,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:40,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-08 13:58:40,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:40,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 13:58:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 13:58:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:58:40,811 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-08 13:58:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:41,020 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-08 13:58:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 13:58:41,020 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-08 13:58:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:41,020 INFO L225 Difference]: With dead ends: 95 [2019-01-08 13:58:41,021 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 13:58:41,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:58:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 13:58:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-08 13:58:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 13:58:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-08 13:58:41,024 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-08 13:58:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:41,025 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-08 13:58:41,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 13:58:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-08 13:58:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-08 13:58:41,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:41,026 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-08 13:58:41,026 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-08 13:58:41,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:44,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:44,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:44,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,183 INFO L193 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 [2019-01-08 13:58:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:44,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:45,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-08 13:58:45,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:45,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:45,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-08 13:58:54,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:54,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:58:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:58:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 13:58:54,562 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-08 13:58:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:54,703 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-08 13:58:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-08 13:58:54,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-08 13:58:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:54,704 INFO L225 Difference]: With dead ends: 96 [2019-01-08 13:58:54,704 INFO L226 Difference]: Without dead ends: 94 [2019-01-08 13:58:54,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 13:58:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-08 13:58:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-08 13:58:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-08 13:58:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-08 13:58:54,708 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-08 13:58:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:54,708 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-08 13:58:54,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:58:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-08 13:58:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-08 13:58:54,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:54,709 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-08 13:58:54,709 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-08 13:58:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:57,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:57,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:57,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:57,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,662 INFO L193 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 [2019-01-08 13:58:57,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:57,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:57,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:57,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:57,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:57,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:06,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:06,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-08 13:59:06,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:06,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-08 13:59:06,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-08 13:59:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 13:59:06,900 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-08 13:59:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:07,144 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-08 13:59:07,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-08 13:59:07,144 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-08 13:59:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:07,145 INFO L225 Difference]: With dead ends: 97 [2019-01-08 13:59:07,145 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 13:59:07,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 13:59:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 13:59:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-08 13:59:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 13:59:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-08 13:59:07,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-08 13:59:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:07,150 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-08 13:59:07,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-08 13:59:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-08 13:59:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-08 13:59:07,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:07,151 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-08 13:59:07,151 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:07,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-08 13:59:07,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:10,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:10,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:10,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:10,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:10,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:10,441 INFO L193 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 [2019-01-08 13:59:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:10,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:10,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:10,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:19,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:19,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-08 13:59:19,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:19,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-08 13:59:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-08 13:59:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 13:59:19,983 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-08 13:59:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:20,182 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-08 13:59:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-08 13:59:20,183 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-08 13:59:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:20,183 INFO L225 Difference]: With dead ends: 98 [2019-01-08 13:59:20,183 INFO L226 Difference]: Without dead ends: 96 [2019-01-08 13:59:20,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 13:59:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-08 13:59:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-08 13:59:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 13:59:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-08 13:59:20,186 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-08 13:59:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:20,186 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-08 13:59:20,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-08 13:59:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-08 13:59:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-08 13:59:20,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:20,187 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-08 13:59:20,187 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-08 13:59:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:23,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:23,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:23,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:23,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,430 INFO L193 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 [2019-01-08 13:59:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:23,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:24,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-08 13:59:24,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:24,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:24,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:34,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:34,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-08 13:59:34,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:34,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 13:59:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 13:59:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 13:59:34,565 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-08 13:59:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:34,713 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-08 13:59:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 13:59:34,714 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-08 13:59:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:34,715 INFO L225 Difference]: With dead ends: 99 [2019-01-08 13:59:34,715 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 13:59:34,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 13:59:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 13:59:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-08 13:59:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 13:59:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-08 13:59:34,718 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-08 13:59:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:34,718 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-08 13:59:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 13:59:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-08 13:59:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 13:59:34,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:34,719 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-08 13:59:34,719 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-08 13:59:34,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:34,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:34,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:37,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:37,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:37,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:37,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:37,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:37,851 INFO L193 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 [2019-01-08 13:59:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:37,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:37,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:37,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:37,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:37,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:47,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:47,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-08 13:59:47,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:47,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-08 13:59:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-08 13:59:47,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 13:59:47,523 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-08 13:59:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:47,684 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-08 13:59:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-08 13:59:47,684 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-08 13:59:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:47,685 INFO L225 Difference]: With dead ends: 100 [2019-01-08 13:59:47,685 INFO L226 Difference]: Without dead ends: 98 [2019-01-08 13:59:47,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 13:59:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-08 13:59:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-08 13:59:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 13:59:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-08 13:59:47,690 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-08 13:59:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:47,690 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-08 13:59:47,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-08 13:59:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-08 13:59:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-08 13:59:47,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:47,691 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-08 13:59:47,691 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-08 13:59:47,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:51,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:51,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:51,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,124 INFO L193 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 [2019-01-08 13:59:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:51,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:51,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-08 14:00:00,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-08 14:00:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-08 14:00:00,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:00:00,921 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-08 14:00:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:01,080 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-08 14:00:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-08 14:00:01,080 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-08 14:00:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:01,081 INFO L225 Difference]: With dead ends: 101 [2019-01-08 14:00:01,081 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 14:00:01,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:00:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 14:00:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-08 14:00:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-08 14:00:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-08 14:00:01,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-08 14:00:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:01,085 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-08 14:00:01,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-08 14:00:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-08 14:00:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-08 14:00:01,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:01,086 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-08 14:00:01,086 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-08 14:00:01,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:04,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:04,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:04,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:04,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:04,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:04,422 INFO L193 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 [2019-01-08 14:00:04,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:04,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:06,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-08 14:00:06,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:06,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:06,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:16,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-08 14:00:16,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:16,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-08 14:00:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-08 14:00:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:00:16,413 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-08 14:00:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:16,573 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-08 14:00:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-08 14:00:16,574 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-08 14:00:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:16,574 INFO L225 Difference]: With dead ends: 102 [2019-01-08 14:00:16,574 INFO L226 Difference]: Without dead ends: 100 [2019-01-08 14:00:16,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:00:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-08 14:00:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-08 14:00:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 14:00:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-08 14:00:16,578 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-08 14:00:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:16,578 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-08 14:00:16,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-08 14:00:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-08 14:00:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-08 14:00:16,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:16,579 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-08 14:00:16,579 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:16,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-08 14:00:16,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:16,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:16,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:20,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:20,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:20,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:20,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,295 INFO L193 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 [2019-01-08 14:00:20,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:20,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:20,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:20,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:20,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:20,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:30,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-08 14:00:30,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:30,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-08 14:00:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-08 14:00:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:00:30,670 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-08 14:00:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:30,880 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-08 14:00:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-08 14:00:30,880 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-08 14:00:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:30,881 INFO L225 Difference]: With dead ends: 103 [2019-01-08 14:00:30,881 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:00:30,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:00:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:00:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-08 14:00:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:00:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-08 14:00:30,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-08 14:00:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-08 14:00:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-08 14:00:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-08 14:00:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 14:00:30,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:30,885 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-08 14:00:30,886 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-08 14:00:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:30,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:30,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:34,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:34,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:34,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:34,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:34,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:34,340 INFO L193 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 [2019-01-08 14:00:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:34,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:34,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:34,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:44,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:44,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-08 14:00:44,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:44,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-08 14:00:44,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-08 14:00:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:00:44,830 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-08 14:00:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:45,121 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-08 14:00:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-08 14:00:45,121 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-08 14:00:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:45,122 INFO L225 Difference]: With dead ends: 104 [2019-01-08 14:00:45,122 INFO L226 Difference]: Without dead ends: 102 [2019-01-08 14:00:45,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:00:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-08 14:00:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-08 14:00:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-08 14:00:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-08 14:00:45,126 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-08 14:00:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:45,126 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-08 14:00:45,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-08 14:00:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-08 14:00:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-08 14:00:45,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:45,127 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-08 14:00:45,127 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-08 14:00:45,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:45,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:45,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:48,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:48,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:48,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:48,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:48,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:48,896 INFO L193 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 [2019-01-08 14:00:48,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:48,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:50,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-08 14:00:50,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:50,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:50,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:01,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:01,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-08 14:01:01,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:01,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 14:01:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 14:01:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:01:01,622 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-08 14:01:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:01,860 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-08 14:01:01,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-08 14:01:01,861 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-08 14:01:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:01,861 INFO L225 Difference]: With dead ends: 105 [2019-01-08 14:01:01,861 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:01:01,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:01:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:01:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-08 14:01:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:01:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-08 14:01:01,865 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-08 14:01:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:01,865 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-08 14:01:01,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 14:01:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-08 14:01:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 14:01:01,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:01,865 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-08 14:01:01,866 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-08 14:01:01,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:01,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:01,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:05,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:05,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:05,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:05,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:05,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:05,453 INFO L193 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 [2019-01-08 14:01:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:05,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:05,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:05,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:05,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:05,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:16,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:16,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-08 14:01:16,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:16,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-08 14:01:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-08 14:01:16,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:01:16,717 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-08 14:01:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:16,987 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-08 14:01:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-08 14:01:16,988 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-08 14:01:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:16,988 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:01:16,989 INFO L226 Difference]: Without dead ends: 104 [2019-01-08 14:01:16,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:01:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-08 14:01:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-08 14:01:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-08 14:01:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-08 14:01:16,993 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-08 14:01:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-08 14:01:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-08 14:01:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-08 14:01:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-08 14:01:16,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:16,995 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-08 14:01:16,995 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-08 14:01:16,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:16,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:16,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:16,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:16,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:20,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:20,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:20,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:20,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:20,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:20,617 INFO L193 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 [2019-01-08 14:01:20,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:20,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:20,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:20,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:32,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:32,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-08 14:01:32,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:32,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-08 14:01:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-08 14:01:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:01:32,034 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-08 14:01:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:32,226 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-08 14:01:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-08 14:01:32,227 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-08 14:01:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:32,228 INFO L225 Difference]: With dead ends: 107 [2019-01-08 14:01:32,228 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:01:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:01:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:01:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-08 14:01:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 14:01:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-08 14:01:32,233 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-08 14:01:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-08 14:01:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-08 14:01:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-08 14:01:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 14:01:32,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:32,235 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-08 14:01:32,235 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:32,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-08 14:01:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:32,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:32,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:35,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:35,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:35,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:35,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:35,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:35,950 INFO L193 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 [2019-01-08 14:01:35,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:35,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:38,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-08 14:01:38,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:38,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:38,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:49,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:49,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-08 14:01:49,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:49,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-08 14:01:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-08 14:01:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:01:49,654 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-08 14:01:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:50,007 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-08 14:01:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-08 14:01:50,007 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-08 14:01:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:50,008 INFO L225 Difference]: With dead ends: 108 [2019-01-08 14:01:50,008 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:01:50,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:01:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:01:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-08 14:01:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-08 14:01:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-08 14:01:50,023 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-08 14:01:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:50,023 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-08 14:01:50,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-08 14:01:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-08 14:01:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-08 14:01:50,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:50,024 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-08 14:01:50,024 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-08 14:01:50,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:50,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:50,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:53,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:53,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:53,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:53,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:53,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:53,935 INFO L193 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 [2019-01-08 14:01:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:53,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:54,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:54,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:54,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:54,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:05,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:05,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-08 14:02:05,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:05,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-08 14:02:05,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-08 14:02:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:02:05,727 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-08 14:02:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:06,025 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-08 14:02:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-08 14:02:06,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-08 14:02:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:06,026 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:02:06,026 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:02:06,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:02:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:02:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-08 14:02:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 14:02:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-08 14:02:06,030 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-08 14:02:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-08 14:02:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-08 14:02:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-08 14:02:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 14:02:06,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:06,031 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-08 14:02:06,031 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-08 14:02:06,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:06,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:06,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:06,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:10,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:10,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:10,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:10,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,173 INFO L193 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 [2019-01-08 14:02:10,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:10,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:10,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:10,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-08 14:02:21,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:21,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-08 14:02:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-08 14:02:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-08 14:02:21,924 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-08 14:02:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:22,156 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-08 14:02:22,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-08 14:02:22,162 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-08 14:02:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:22,162 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:02:22,163 INFO L226 Difference]: Without dead ends: 108 [2019-01-08 14:02:22,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-08 14:02:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-08 14:02:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-08 14:02:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-08 14:02:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-08 14:02:22,167 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-08 14:02:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:22,167 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-08 14:02:22,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-08 14:02:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-08 14:02:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-08 14:02:22,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:22,167 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-08 14:02:22,168 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-08 14:02:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:26,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:26,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:26,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:26,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,272 INFO L193 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 [2019-01-08 14:02:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:26,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:28,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-08 14:02:28,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:28,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:28,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-08 14:02:40,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:40,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:02:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:02:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-08 14:02:40,536 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-08 14:02:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:40,777 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-08 14:02:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-08 14:02:40,778 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-08 14:02:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:40,778 INFO L225 Difference]: With dead ends: 111 [2019-01-08 14:02:40,778 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:02:40,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-08 14:02:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:02:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-08 14:02:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 14:02:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-08 14:02:40,781 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-08 14:02:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:40,781 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-08 14:02:40,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:02:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-08 14:02:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 14:02:40,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:40,782 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-08 14:02:40,782 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-08 14:02:40,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:45,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:45,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:45,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:45,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:45,032 INFO L193 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 [2019-01-08 14:02:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:45,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:45,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:45,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:45,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:57,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:57,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-08 14:02:57,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:57,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-08 14:02:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-08 14:02:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-08 14:02:57,241 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-08 14:02:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:57,493 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-08 14:02:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-08 14:02:57,494 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-08 14:02:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:57,494 INFO L225 Difference]: With dead ends: 112 [2019-01-08 14:02:57,494 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:02:57,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-08 14:02:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:02:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-08 14:02:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-08 14:02:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-08 14:02:57,498 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-08 14:02:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:57,498 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-08 14:02:57,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-08 14:02:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-08 14:02:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-08 14:02:57,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:57,499 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-08 14:02:57,500 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-08 14:02:57,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:57,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:57,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:01,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:01,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:01,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:01,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,799 INFO L193 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 [2019-01-08 14:03:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:01,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:01,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:14,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-08 14:03:14,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-08 14:03:14,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-08 14:03:14,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-08 14:03:14,559 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-08 14:03:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:14,838 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-08 14:03:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-08 14:03:14,838 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-08 14:03:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:14,839 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:03:14,839 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 14:03:14,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-08 14:03:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 14:03:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-08 14:03:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:03:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-08 14:03:14,842 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-08 14:03:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-08 14:03:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-08 14:03:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-08 14:03:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-08 14:03:14,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:14,844 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-08 14:03:14,844 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-08 14:03:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:14,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:18,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:18,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:18,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:18,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:18,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:18,900 INFO L193 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 [2019-01-08 14:03:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:18,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:21,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-08 14:03:21,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:21,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:21,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:34,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:34,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-08 14:03:34,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:34,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-08 14:03:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-08 14:03:34,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 14:03:34,394 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-08 14:03:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:34,735 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-08 14:03:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-08 14:03:34,735 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-08 14:03:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:34,735 INFO L225 Difference]: With dead ends: 114 [2019-01-08 14:03:34,736 INFO L226 Difference]: Without dead ends: 112 [2019-01-08 14:03:34,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 14:03:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-08 14:03:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-08 14:03:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 14:03:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-08 14:03:34,739 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-08 14:03:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:34,739 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-08 14:03:34,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-08 14:03:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-08 14:03:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 14:03:34,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:34,740 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-08 14:03:34,740 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-08 14:03:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:34,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:34,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:34,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:38,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:38,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:38,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:38,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:38,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:38,902 INFO L193 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 [2019-01-08 14:03:38,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:38,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:38,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:38,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:38,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:39,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-08 14:03:51,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-08 14:03:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-08 14:03:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-08 14:03:51,831 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-08 14:03:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:52,114 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-08 14:03:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-08 14:03:52,115 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-08 14:03:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:52,116 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:03:52,116 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:03:52,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-08 14:03:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:03:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-08 14:03:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 14:03:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-08 14:03:52,121 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-08 14:03:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:52,121 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-08 14:03:52,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-08 14:03:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-08 14:03:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-08 14:03:52,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:52,122 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-08 14:03:52,123 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-08 14:03:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:52,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:52,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:56,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:56,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:56,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:56,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:56,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:56,699 INFO L193 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 [2019-01-08 14:03:56,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:56,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:56,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:09,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:09,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-08 14:04:09,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:09,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-08 14:04:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-08 14:04:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-08 14:04:09,711 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-08 14:04:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:09,942 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-08 14:04:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-08 14:04:09,942 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-08 14:04:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:09,943 INFO L225 Difference]: With dead ends: 116 [2019-01-08 14:04:09,943 INFO L226 Difference]: Without dead ends: 114 [2019-01-08 14:04:09,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-08 14:04:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-08 14:04:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-08 14:04:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-08 14:04:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-08 14:04:09,948 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-08 14:04:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:09,948 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-08 14:04:09,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-08 14:04:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-08 14:04:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-08 14:04:09,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:09,949 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-08 14:04:09,949 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-08 14:04:09,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:09,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:14,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:14,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:14,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:14,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:14,564 INFO L193 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 [2019-01-08 14:04:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:14,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:17,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-08 14:04:17,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:17,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:17,594 INFO L316 TraceCheckSpWp]: Computing backward predicates...