java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:26:35,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:26:35,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:26:35,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:26:35,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:26:35,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:26:35,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:26:35,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:26:35,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:26:35,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:26:35,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:26:35,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:26:35,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:26:35,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:26:35,885 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:26:35,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:26:35,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:26:35,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:26:35,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:26:35,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:26:35,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:26:35,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:26:35,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:26:35,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:26:35,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:26:35,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:26:35,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:26:35,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:26:35,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:26:35,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:26:35,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:26:35,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:26:35,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:26:35,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:26:35,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:26:35,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:26:35,908 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-18 17:26:35,922 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:26:35,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:26:35,923 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:26:35,923 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:26:35,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:26:35,924 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:26:35,924 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:26:35,924 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:26:35,924 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:26:35,925 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:26:35,925 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:26:35,925 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:26:35,925 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:26:35,926 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:26:35,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:26:35,927 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:26:35,928 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:26:35,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:26:35,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:26:35,931 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:26:35,931 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:26:35,931 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:26:35,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:26:35,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:26:35,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:26:35,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:26:35,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:35,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:26:35,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:26:35,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:26:35,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:26:35,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:26:35,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:26:35,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:26:35,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:26:35,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:26:36,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:26:36,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:26:36,006 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:26:36,007 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:26:36,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-18 17:26:36,008 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-18 17:26:36,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:26:36,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:26:36,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:26:36,063 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:26:36,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:26:36,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:26:36,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:26:36,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:26:36,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:26:36,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:36,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:26:36,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:26:36,468 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:26:36,468 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-18 17:26:36,471 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36 BoogieIcfgContainer [2019-01-18 17:26:36,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:26:36,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:26:36,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:26:36,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:26:36,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/2) ... [2019-01-18 17:26:36,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f444333 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:26:36, skipping insertion in model container [2019-01-18 17:26:36,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36" (2/2) ... [2019-01-18 17:26:36,481 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-18 17:26:36,492 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:26:36,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:26:36,520 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:26:36,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:26:36,560 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:26:36,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:26:36,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:26:36,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:26:36,561 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:26:36,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:26:36,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:26:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-18 17:26:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:26:36,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:26:36,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-18 17:26:36,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:36,745 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-18 17:26:36,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:36,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:26:36,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:36,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:26:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:26:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:26:36,765 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-18 17:26:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:36,869 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 17:26:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:26:36,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 17:26:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:36,904 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:26:36,904 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:26:36,909 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-18 17:26:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:26:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:26:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:26:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-18 17:26:36,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-18 17:26:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:36,983 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-18 17:26:36,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:26:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-18 17:26:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:26:36,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:26:36,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-18 17:26:36,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:26:37,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:37,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:26:37,056 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-18 17:26:37,096 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:26:37,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:26:37,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:26:37,285 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:26:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:26:37,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,293 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-18 17:26:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:26:37,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:26:37,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:37,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-18 17:26:37,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:37,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:26:37,623 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-18 17:26:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,678 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-18 17:26:37,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:26:37,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-18 17:26:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,679 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:26:37,680 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:26:37,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-18 17:26:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:26:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:26:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:26:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-18 17:26:37,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-18 17:26:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,684 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-18 17:26:37,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-18 17:26:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:26:37,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,685 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-18 17:26:37,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-18 17:26:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:26:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:37,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:37,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:37,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,768 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-18 17:26:37,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:37,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:37,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:26:37,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:37,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:26:37,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:26:37,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:37,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-18 17:26:37,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:37,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:26:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:26:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:26:37,978 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-18 17:26:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:38,136 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-18 17:26:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:26:38,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 17:26:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:38,138 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:26:38,138 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:26:38,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-18 17:26:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:26:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:26:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:26:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-18 17:26:38,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-18 17:26:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:38,145 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-18 17:26:38,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:26:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-18 17:26:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:26:38,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:38,147 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-18 17:26:38,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-18 17:26:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:26:38,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:38,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:38,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,289 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-18 17:26:38,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:38,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:38,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:38,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:38,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:26:38,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:26:38,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:26:38,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:26:38,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:26:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:26:38,507 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-18 17:26:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:38,624 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-18 17:26:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:26:38,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-18 17:26:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:38,625 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:26:38,626 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:26:38,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:26:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:26:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:26:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:26:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-18 17:26:38,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-18 17:26:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:38,631 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-18 17:26:38,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:26:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-18 17:26:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:26:38,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:38,632 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-18 17:26:38,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-18 17:26:38,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:38,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:26:38,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:38,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:38,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,750 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-18 17:26:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:38,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:26:38,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:26:38,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-18 17:26:38,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:26:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:26:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:26:38,916 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-18 17:26:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,030 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-18 17:26:39,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:26:39,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-18 17:26:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,031 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:26:39,031 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:26:39,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:26:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:26:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:26:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:26:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-18 17:26:39,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-18 17:26:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,035 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-18 17:26:39,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:26:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-18 17:26:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:26:39,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,037 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-18 17:26:39,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-18 17:26:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:26:39,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,387 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-18 17:26:39,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:39,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:39,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:26:39,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:26:39,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:26:39,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:39,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-18 17:26:39,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:39,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:26:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:26:39,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:39,633 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-18 17:26:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,710 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-18 17:26:39,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:26:39,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-18 17:26:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,711 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:26:39,711 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:26:39,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 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-18 17:26:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:26:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:26:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:26:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-18 17:26:39,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-18 17:26:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,716 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-18 17:26:39,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:26:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-18 17:26:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:26:39,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,717 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-18 17:26:39,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-18 17:26:39,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:26:39,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:39,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,852 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-18 17:26:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:39,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:39,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:39,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:26:39,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:26:40,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-18 17:26:40,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:26:40,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:26:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:40,180 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-18 17:26:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,254 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-18 17:26:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:26:40,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-18 17:26:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,256 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:26:40,256 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:26:40,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:26:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:26:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:26:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-18 17:26:40,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-18 17:26:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,261 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-18 17:26:40,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:26:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-18 17:26:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:26:40,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,262 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-18 17:26:40,262 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-18 17:26:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:26:40,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:40,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,454 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-18 17:26:40,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:40,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:26:40,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:26:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-18 17:26:40,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:26:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:26:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:26:40,702 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-18 17:26:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,762 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-18 17:26:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:26:40,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-18 17:26:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,765 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:26:40,765 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:26:40,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:26:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:26:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:26:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:26:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-18 17:26:40,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-18 17:26:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,770 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-18 17:26:40,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:26:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-18 17:26:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:26:40,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,771 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-18 17:26:40,772 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-18 17:26:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:26:40,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:40,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,906 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-18 17:26:40,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:40,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:40,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:26:40,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:40,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:26:40,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:26:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-18 17:26:41,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:26:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:26:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:26:41,181 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-18 17:26:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,436 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-18 17:26:41,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:26:41,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-18 17:26:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,437 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:26:41,437 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:26:41,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:26:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:26:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:26:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:26:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-18 17:26:41,447 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-18 17:26:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,448 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-18 17:26:41,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:26:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-18 17:26:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:26:41,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,450 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-18 17:26:41,450 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-18 17:26:41,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:41,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:26:41,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:41,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:41,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:41,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,648 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-18 17:26:41,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:41,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:41,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:41,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:41,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:26:41,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:26:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-18 17:26:41,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:26:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:26:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,894 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-18 17:26:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,964 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-18 17:26:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:26:41,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-18 17:26:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,965 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:26:41,965 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:26:41,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:26:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:26:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:26:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-18 17:26:41,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-18 17:26:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,969 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-18 17:26:41,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:26:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-18 17:26:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:26:41,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,970 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-18 17:26:41,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-18 17:26:41,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:26:42,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:42,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:42,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:42,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,304 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-18 17:26:42,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:42,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:42,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:26:42,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:26:42,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-18 17:26:42,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:42,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:26:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:26:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:26:42,845 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-18 17:26:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:42,896 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-18 17:26:42,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:26:42,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-18 17:26:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:42,900 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:26:42,900 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:26:42,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:26:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:26:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:26:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:26:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-18 17:26:42,906 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-18 17:26:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:42,906 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-18 17:26:42,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:26:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-18 17:26:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:26:42,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:42,907 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-18 17:26:42,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-18 17:26:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:26:43,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:43,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:43,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:43,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,082 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-18 17:26:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:43,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:43,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:26:43,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:43,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:26:43,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:26:43,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:43,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-18 17:26:43,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:43,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:26:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:26:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:26:43,369 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-18 17:26:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:43,461 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-18 17:26:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:26:43,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-18 17:26:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:43,462 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:26:43,462 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:26:43,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:26:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:26:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:26:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:26:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-18 17:26:43,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-18 17:26:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:43,468 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-18 17:26:43,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:26:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-18 17:26:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:26:43,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:43,469 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-18 17:26:43,469 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-18 17:26:43,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:43,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:26:43,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:43,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:43,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:43,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,779 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-18 17:26:43,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:43,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:43,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:43,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:43,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:26:43,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:26:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:44,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-18 17:26:44,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:44,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:26:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:26:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:44,135 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-18 17:26:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:44,247 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-18 17:26:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:26:44,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-18 17:26:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:44,248 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:26:44,248 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:26:44,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:26:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:26:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:26:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-18 17:26:44,255 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-18 17:26:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:44,255 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-18 17:26:44,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:26:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-18 17:26:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:26:44,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:44,256 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-18 17:26:44,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-18 17:26:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:26:44,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:44,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:44,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,542 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-18 17:26:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:44,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:44,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:26:44,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:26:45,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-18 17:26:45,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:26:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:26:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:45,041 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-18 17:26:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:45,287 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-18 17:26:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:26:45,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-18 17:26:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:45,288 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:26:45,289 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:26:45,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:26:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:26:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:26:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-18 17:26:45,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-18 17:26:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:45,296 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-18 17:26:45,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:26:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-18 17:26:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:26:45,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:45,297 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-18 17:26:45,297 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-18 17:26:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:26:45,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:45,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:45,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:45,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,464 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-18 17:26:45,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:45,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:45,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:26:45,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:45,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:26:45,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:26:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-18 17:26:45,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:45,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:26:45,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:26:45,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:26:45,926 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-18 17:26:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:45,984 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-18 17:26:45,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:26:45,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-18 17:26:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:45,986 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:26:45,986 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:26:45,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:26:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:26:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:26:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:26:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-18 17:26:45,991 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-18 17:26:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:45,991 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-18 17:26:45,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:26:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-18 17:26:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:26:45,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:45,992 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-18 17:26:45,992 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-18 17:26:45,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:26:46,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:46,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:46,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:46,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,240 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-18 17:26:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:46,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:46,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:46,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:46,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:26:46,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:26:46,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-18 17:26:46,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:46,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:26:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:26:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:46,689 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-18 17:26:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:46,811 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-18 17:26:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:26:46,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-18 17:26:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:46,813 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:26:46,813 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:26:46,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:26:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:26:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:26:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-18 17:26:46,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-18 17:26:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:46,817 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-18 17:26:46,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:26:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-18 17:26:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:26:46,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:46,818 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-18 17:26:46,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:46,819 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-18 17:26:46,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:46,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:46,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:26:47,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:47,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:47,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:47,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,432 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-18 17:26:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:47,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:26:47,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:26:48,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:48,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-18 17:26:48,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:48,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:26:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:26:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:26:48,194 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-18 17:26:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:48,268 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-18 17:26:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:26:48,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-18 17:26:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:48,269 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:26:48,269 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:26:48,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:26:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:26:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:26:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:26:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-18 17:26:48,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-18 17:26:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:48,276 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-18 17:26:48,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:26:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-18 17:26:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:26:48,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:48,277 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-18 17:26:48,277 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-18 17:26:48,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:48,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:26:49,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:49,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:49,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:49,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,031 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-18 17:26:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:49,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:49,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:26:49,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:49,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:26:49,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:26:49,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:49,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-18 17:26:49,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:49,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:26:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:26:49,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:49,996 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-18 17:26:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:50,078 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-18 17:26:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:26:50,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-18 17:26:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:50,081 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:26:50,081 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:26:50,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:26:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:26:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:26:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-18 17:26:50,086 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-18 17:26:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-18 17:26:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:26:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-18 17:26:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:26:50,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:50,088 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-18 17:26:50,088 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-18 17:26:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:26:50,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:50,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:50,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:50,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,980 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-18 17:26:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:50,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:51,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:51,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:51,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:26:51,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:26:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-18 17:26:51,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:51,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:26:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:26:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:51,537 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-18 17:26:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:51,604 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-18 17:26:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:26:51,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-18 17:26:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:51,605 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:26:51,605 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:26:51,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 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-18 17:26:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:26:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:26:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:26:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-18 17:26:51,611 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-18 17:26:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-18 17:26:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:26:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-18 17:26:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:26:51,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:51,613 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-18 17:26:51,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-18 17:26:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:26:52,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:52,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:52,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:52,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,347 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-18 17:26:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:52,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:26:52,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:26:52,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-18 17:26:52,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:52,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:26:52,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:26:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:26:52,894 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-18 17:26:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:53,064 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-18 17:26:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:26:53,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-18 17:26:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:53,066 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:26:53,066 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:26:53,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:26:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:26:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:26:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:26:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-18 17:26:53,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-18 17:26:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:53,073 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-18 17:26:53,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:26:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-18 17:26:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:26:53,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:53,074 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-18 17:26:53,075 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-18 17:26:53,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:26:53,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:53,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:53,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:53,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,399 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-18 17:26:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:53,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:53,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:26:53,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:53,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:26:53,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:26:54,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:54,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-18 17:26:54,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:54,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:26:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:26:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:26:54,369 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-18 17:26:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:54,479 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-18 17:26:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:26:54,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-18 17:26:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:54,480 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:26:54,481 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:26:54,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:26:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:26:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:26:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:26:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-18 17:26:54,487 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-18 17:26:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:54,487 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-18 17:26:54,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:26:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-18 17:26:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:26:54,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:54,488 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-18 17:26:54,488 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:54,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:54,488 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-18 17:26:54,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:54,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:54,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:26:54,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:54,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:54,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:54,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,845 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-18 17:26:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:54,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:54,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:54,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:54,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:26:54,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:26:55,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-18 17:26:55,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:26:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:26:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:55,465 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-18 17:26:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:55,600 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-18 17:26:55,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:26:55,603 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-18 17:26:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:55,603 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:26:55,603 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:26:55,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:26:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:26:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:26:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-18 17:26:55,608 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-18 17:26:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:55,608 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-18 17:26:55,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:26:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-18 17:26:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:26:55,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:55,610 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-18 17:26:55,610 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-18 17:26:55,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:26:55,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:55,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:55,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:55,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,991 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-18 17:26:56,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:56,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:56,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:26:56,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:26:56,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:56,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-18 17:26:56,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:56,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:26:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:26:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:26:56,777 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-18 17:26:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:56,904 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-18 17:26:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:26:56,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-18 17:26:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:56,907 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:26:56,907 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:26:56,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 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-18 17:26:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:26:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:26:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:26:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-18 17:26:56,911 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-18 17:26:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:56,912 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-18 17:26:56,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:26:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-18 17:26:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:26:56,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:56,913 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-18 17:26:56,913 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-18 17:26:56,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:56,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:56,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:26:57,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:57,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:57,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:57,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:57,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:57,534 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-18 17:26:57,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:57,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:57,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:26:57,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:57,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:26:57,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:26:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-18 17:26:58,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:26:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:26:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:26:58,333 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-18 17:26:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:58,436 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-18 17:26:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:26:58,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-18 17:26:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:58,438 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:26:58,438 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:26:58,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:26:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:26:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:26:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:26:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-18 17:26:58,443 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-18 17:26:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:58,443 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-18 17:26:58,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:26:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-18 17:26:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:26:58,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:58,444 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-18 17:26:58,444 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-18 17:26:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:26:59,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:59,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:59,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:59,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:59,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:59,016 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-18 17:26:59,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:59,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:59,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:59,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:59,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:26:59,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:26:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-18 17:26:59,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:59,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:26:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:26:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:26:59,859 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-18 17:26:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:59,960 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-18 17:26:59,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:26:59,960 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-18 17:26:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:59,961 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:26:59,961 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:26:59,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:26:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:26:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:26:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:26:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-18 17:26:59,965 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-18 17:26:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:59,966 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-18 17:26:59,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:26:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-18 17:26:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:26:59,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:59,967 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-18 17:26:59,967 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:59,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-18 17:26:59,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:27:00,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:00,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:00,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:00,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,569 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-18 17:27:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:00,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:00,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:27:00,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:27:01,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:01,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-18 17:27:01,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:01,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:27:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:27:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:27:01,828 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-18 17:27:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:01,954 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-18 17:27:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:27:01,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-18 17:27:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:01,955 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:27:01,955 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:27:01,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:27:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:27:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:27:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:27:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-18 17:27:01,961 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-18 17:27:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:01,961 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-18 17:27:01,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:27:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-18 17:27:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:27:01,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:01,962 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-18 17:27:01,962 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-18 17:27:01,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:27:02,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:02,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:02,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:02,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,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 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-18 17:27:02,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:02,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:02,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:27:02,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:02,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:27:02,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:27:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-18 17:27:03,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:03,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:27:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:27:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:27:03,522 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-18 17:27:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:03,632 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-18 17:27:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:27:03,632 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-18 17:27:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:03,633 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:27:03,633 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:27:03,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:27:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:27:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:27:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:27:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-18 17:27:03,638 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-18 17:27:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:03,638 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-18 17:27:03,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:27:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-18 17:27:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:27:03,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:03,639 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-18 17:27:03,640 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-18 17:27:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:27:04,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:04,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:04,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:04,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,287 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-18 17:27:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:04,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:04,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:04,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:27:04,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:27:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-18 17:27:05,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:05,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:27:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:27:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:05,434 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-18 17:27:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:05,559 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-18 17:27:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:27:05,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-18 17:27:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:05,560 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:27:05,560 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:27:05,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:27:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:27:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:27:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-18 17:27:05,565 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-18 17:27:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:05,565 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-18 17:27:05,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:27:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-18 17:27:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:27:05,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:05,566 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-18 17:27:05,566 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-18 17:27:05,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:05,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:27:05,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:05,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:05,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:05,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,966 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-18 17:27:05,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:05,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:06,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:27:06,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:27:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-18 17:27:06,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:06,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:27:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:27:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:27:06,964 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-18 17:27:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:07,085 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-18 17:27:07,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:27:07,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-18 17:27:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:07,087 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:27:07,087 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:27:07,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:27:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:27:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:27:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:27:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-18 17:27:07,091 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-18 17:27:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:07,092 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-18 17:27:07,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:27:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-18 17:27:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:27:07,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:07,093 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-18 17:27:07,093 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-18 17:27:07,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:27:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:07,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:07,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:07,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,861 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-18 17:27:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:07,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:08,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:27:08,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:08,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:27:08,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:27:09,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:09,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-18 17:27:09,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:09,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:27:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:27:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:09,404 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-18 17:27:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:09,511 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-18 17:27:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:27:09,511 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-18 17:27:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:09,512 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:27:09,512 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:27:09,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:27:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:27:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:27:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-18 17:27:09,515 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-18 17:27:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:09,516 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-18 17:27:09,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:27:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-18 17:27:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:27:09,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:09,516 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-18 17:27:09,516 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-18 17:27:09,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:27:09,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:09,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:09,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,982 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-18 17:27:09,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:09,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:10,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:10,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:10,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:27:10,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:27:11,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:11,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-18 17:27:11,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:11,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:27:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:27:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:11,127 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-18 17:27:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:11,284 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-18 17:27:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:27:11,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-18 17:27:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:11,285 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:27:11,286 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:27:11,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:27:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:27:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:27:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-18 17:27:11,288 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-18 17:27:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:11,289 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-18 17:27:11,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:27:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-18 17:27:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:27:11,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:11,289 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-18 17:27:11,290 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-18 17:27:11,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:11,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:11,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:27:11,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:11,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:11,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:11,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,865 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-18 17:27:11,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:11,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:11,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:27:11,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:27:13,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:13,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-18 17:27:13,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:27:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:27:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:27:13,066 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-18 17:27:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:13,203 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-18 17:27:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:27:13,204 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-18 17:27:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:13,205 INFO L225 Difference]: With dead ends: 103 [2019-01-18 17:27:13,205 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:27:13,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:27:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:27:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:27:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:27:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-18 17:27:13,209 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-18 17:27:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:13,210 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-18 17:27:13,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:27:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-18 17:27:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:27:13,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:13,210 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-18 17:27:13,211 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-18 17:27:13,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:27:14,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:14,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:14,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:14,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,446 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-18 17:27:14,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:14,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:14,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:27:14,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:14,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:27:14,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:27:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-18 17:27:15,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:15,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:27:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:27:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:27:15,871 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-18 17:27:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:16,021 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-18 17:27:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:27:16,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-18 17:27:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:16,023 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:27:16,023 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:27:16,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:27:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:27:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:27:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:27:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-18 17:27:16,027 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-18 17:27:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:16,027 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-18 17:27:16,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:27:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-18 17:27:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:27:16,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:16,028 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-18 17:27:16,028 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-18 17:27:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:16,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:16,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:27:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:16,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:16,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:16,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:16,680 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-18 17:27:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:16,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:16,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:16,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:16,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:27:16,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:27:17,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:17,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-18 17:27:17,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:17,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:27:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:27:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:17,999 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-18 17:27:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:18,166 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-18 17:27:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:27:18,167 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-18 17:27:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:18,167 INFO L225 Difference]: With dead ends: 109 [2019-01-18 17:27:18,167 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:27:18,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:27:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:27:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:27:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-18 17:27:18,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-18 17:27:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:18,171 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-18 17:27:18,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:27:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-18 17:27:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:27:18,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:18,172 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-18 17:27:18,172 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-18 17:27:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:27:18,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:18,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:18,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:18,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,701 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-18 17:27:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:18,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:18,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:27:18,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:27:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:20,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-18 17:27:20,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:27:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:27:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:27:20,559 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-18 17:27:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:20,812 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-18 17:27:20,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:27:20,812 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-18 17:27:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:20,813 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:27:20,813 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:27:20,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:27:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:27:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:27:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:27:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-18 17:27:20,816 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-18 17:27:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:20,816 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-18 17:27:20,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:27:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-18 17:27:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:27:20,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:20,816 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-18 17:27:20,817 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-18 17:27:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:20,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:27:21,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:21,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:21,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:21,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:21,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:21,486 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-18 17:27:21,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:21,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:21,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:27:21,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:21,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:27:21,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:27:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-18 17:27:23,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:23,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:27:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:27:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:27:23,680 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-18 17:27:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:23,820 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-18 17:27:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:27:23,820 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-18 17:27:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:23,821 INFO L225 Difference]: With dead ends: 115 [2019-01-18 17:27:23,821 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:27:23,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 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-18 17:27:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:27:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:27:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:27:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-18 17:27:23,824 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-18 17:27:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:23,824 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-18 17:27:23,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:27:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-18 17:27:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:27:23,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:23,825 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-18 17:27:23,825 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-18 17:27:23,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:27:24,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:24,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:24,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:24,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:24,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:24,815 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-18 17:27:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:24,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:24,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:24,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:24,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:27:24,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:27:26,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-18 17:27:26,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:26,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:27:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:27:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:26,478 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-18 17:27:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:26,629 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-18 17:27:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:27:26,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-18 17:27:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:26,630 INFO L225 Difference]: With dead ends: 118 [2019-01-18 17:27:26,631 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:27:26,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:27:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:27:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:27:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-18 17:27:26,633 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-18 17:27:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:26,633 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-18 17:27:26,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:27:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-18 17:27:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:27:26,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:26,634 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-18 17:27:26,634 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-18 17:27:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:26,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:26,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:26,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:27:27,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:27,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:27,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:27,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:27,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:27,335 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-18 17:27:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:27,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:27,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:27:27,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:27:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:29,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-18 17:27:29,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:29,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:27:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:27:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:29,134 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-18 17:27:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:29,285 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-18 17:27:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:27:29,285 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-18 17:27:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:29,285 INFO L225 Difference]: With dead ends: 121 [2019-01-18 17:27:29,286 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:27:29,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:27:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:27:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:27:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-18 17:27:29,289 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-18 17:27:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:29,289 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-18 17:27:29,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:27:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-18 17:27:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:27:29,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:29,290 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-18 17:27:29,290 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-18 17:27:29,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:27:30,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:30,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:30,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:30,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,145 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-18 17:27:30,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:30,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:30,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:27:30,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:30,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:27:30,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:27:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:32,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-18 17:27:32,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:32,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:27:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:27:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:27:32,499 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-18 17:27:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:32,648 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-18 17:27:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:27:32,649 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-18 17:27:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:32,650 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:27:32,650 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:27:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:27:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:27:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:27:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:27:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-18 17:27:32,654 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-18 17:27:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:32,654 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-18 17:27:32,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:27:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-18 17:27:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:27:32,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:32,654 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-18 17:27:32,655 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:32,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-18 17:27:32,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:32,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:32,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:27:33,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:33,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:33,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:33,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,319 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-18 17:27:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:33,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:33,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:33,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:33,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:27:33,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:27:35,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:35,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-18 17:27:35,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:35,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:27:35,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:27:35,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:35,381 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-18 17:27:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:35,528 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-18 17:27:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:27:35,528 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-18 17:27:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:35,529 INFO L225 Difference]: With dead ends: 127 [2019-01-18 17:27:35,529 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:27:35,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:27:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:27:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:27:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-18 17:27:35,532 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-18 17:27:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:35,533 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-18 17:27:35,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:27:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-18 17:27:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:27:35,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:35,533 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-18 17:27:35,534 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-18 17:27:35,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:35,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:35,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:27:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:36,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:36,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,505 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-18 17:27:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:36,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:27:36,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:27:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-18 17:27:38,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:38,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:27:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:27:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:27:38,450 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-18 17:27:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:38,621 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-18 17:27:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:27:38,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-18 17:27:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:38,622 INFO L225 Difference]: With dead ends: 130 [2019-01-18 17:27:38,622 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:27:38,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:27:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:27:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:27:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:27:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-18 17:27:38,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-18 17:27:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:38,626 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-18 17:27:38,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:27:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-18 17:27:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:27:38,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:38,627 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-18 17:27:38,627 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-18 17:27:38,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:38,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:27:40,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:40,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:40,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:40,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:40,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:40,014 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-18 17:27:40,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:40,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:40,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:27:40,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:40,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:27:40,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:27:42,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:42,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-18 17:27:42,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:42,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:27:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:27:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:42,226 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-18 17:27:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:42,401 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-18 17:27:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:27:42,401 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-18 17:27:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:42,402 INFO L225 Difference]: With dead ends: 133 [2019-01-18 17:27:42,402 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:27:42,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:27:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:27:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:27:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-18 17:27:42,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-18 17:27:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:42,406 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-18 17:27:42,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:27:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-18 17:27:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:27:42,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:42,407 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-18 17:27:42,407 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-18 17:27:42,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:42,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:42,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:27:44,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:44,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:44,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:44,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:44,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:44,291 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-18 17:27:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:44,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:44,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:44,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:44,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:27:44,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:27:46,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:46,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-18 17:27:46,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:46,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:27:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:27:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:46,795 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-18 17:27:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:46,969 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-18 17:27:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:27:46,969 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-18 17:27:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:46,970 INFO L225 Difference]: With dead ends: 136 [2019-01-18 17:27:46,970 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:27:46,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:27:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:27:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:27:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-18 17:27:46,973 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-18 17:27:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:46,974 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-18 17:27:46,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:27:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-18 17:27:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:27:46,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:46,974 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-18 17:27:46,975 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-18 17:27:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:46,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:46,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:27:47,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:47,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:47,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:47,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:47,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:47,924 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-18 17:27:47,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:47,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:47,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:27:48,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:27:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:50,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-18 17:27:50,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:50,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:27:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:27:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:27:50,043 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-18 17:27:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:50,355 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-18 17:27:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:27:50,355 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-18 17:27:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:50,356 INFO L225 Difference]: With dead ends: 139 [2019-01-18 17:27:50,356 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:27:50,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:27:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:27:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:27:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:27:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-18 17:27:50,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-18 17:27:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:50,360 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-18 17:27:50,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:27:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-18 17:27:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:27:50,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:50,361 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-18 17:27:50,361 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-18 17:27:50,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:50,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:50,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:27:51,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:51,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:51,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:51,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:51,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:51,618 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-18 17:27:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:51,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:51,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:27:51,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:51,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:27:52,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:27:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-18 17:27:54,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:54,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:27:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:27:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:27:54,200 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-18 17:27:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:56,041 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-18 17:27:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:27:56,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-18 17:27:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:56,042 INFO L225 Difference]: With dead ends: 142 [2019-01-18 17:27:56,042 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:27:56,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:27:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:27:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 17:27:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 17:27:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-18 17:27:56,046 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-18 17:27:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:56,047 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-18 17:27:56,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:27:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-18 17:27:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 17:27:56,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:56,048 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-18 17:27:56,048 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-18 17:27:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:27:57,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:57,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:57,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:57,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,537 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-18 17:27:57,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:57,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:57,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:57,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:57,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:27:57,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:28:00,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:00,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-18 17:28:00,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:00,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:28:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:28:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:28:00,995 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-18 17:28:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:01,218 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-18 17:28:01,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:28:01,220 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-18 17:28:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:01,221 INFO L225 Difference]: With dead ends: 145 [2019-01-18 17:28:01,221 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:28:01,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:28:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:28:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 17:28:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 17:28:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-18 17:28:01,225 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-18 17:28:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:01,225 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-18 17:28:01,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:28:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-18 17:28:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 17:28:01,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:01,226 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-18 17:28:01,226 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-18 17:28:01,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:01,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:01,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:01,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:01,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:28:02,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:02,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:02,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:02,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:02,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:02,268 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-18 17:28:02,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:02,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:02,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:28:02,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:28:04,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:04,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-18 17:28:04,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:04,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:28:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:28:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:28:04,766 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-18 17:28:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:04,955 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-18 17:28:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:28:04,955 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-18 17:28:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:04,956 INFO L225 Difference]: With dead ends: 148 [2019-01-18 17:28:04,956 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:28:04,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:28:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:28:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 17:28:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 17:28:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-18 17:28:04,959 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-18 17:28:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:04,960 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-18 17:28:04,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:28:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-18 17:28:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 17:28:04,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:04,961 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-18 17:28:04,961 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-18 17:28:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:04,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:28:06,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:06,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:06,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:06,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:06,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:06,157 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-18 17:28:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:06,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:06,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:28:06,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:06,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:28:06,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:28:09,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:09,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-18 17:28:09,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:09,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:28:09,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:28:09,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:28:09,175 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-18 17:28:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:09,367 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-18 17:28:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:28:09,368 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-18 17:28:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:09,368 INFO L225 Difference]: With dead ends: 151 [2019-01-18 17:28:09,368 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:28:09,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:28:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:28:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 17:28:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:28:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-18 17:28:09,373 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-18 17:28:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:09,374 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-18 17:28:09,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:28:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-18 17:28:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:28:09,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:09,374 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-18 17:28:09,375 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-18 17:28:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:09,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:09,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:28:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:11,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:11,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:11,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:11,181 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-18 17:28:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:11,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:11,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:11,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:11,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:28:11,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:28:13,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:13,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-18 17:28:13,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:13,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:28:13,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:28:13,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:13,762 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-18 17:28:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:14,041 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-18 17:28:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:28:14,041 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-18 17:28:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:14,042 INFO L225 Difference]: With dead ends: 154 [2019-01-18 17:28:14,042 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:28:14,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:28:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 17:28:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 17:28:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-18 17:28:14,046 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-18 17:28:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:14,046 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-18 17:28:14,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:28:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-18 17:28:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 17:28:14,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:14,047 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-18 17:28:14,047 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-18 17:28:14,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:28:15,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:15,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:15,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:15,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:15,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:15,097 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-18 17:28:15,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:15,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:15,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:28:15,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:28:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:18,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-18 17:28:18,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:18,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:28:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:28:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:18,227 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-18 17:28:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:18,469 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-18 17:28:18,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:28:18,469 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-18 17:28:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:18,470 INFO L225 Difference]: With dead ends: 157 [2019-01-18 17:28:18,470 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:28:18,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:28:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 17:28:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 17:28:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-18 17:28:18,474 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-18 17:28:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:18,474 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-18 17:28:18,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:28:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-18 17:28:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 17:28:18,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:18,475 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-18 17:28:18,475 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-18 17:28:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:18,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:18,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:28:20,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:20,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:20,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:20,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:20,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:20,261 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-18 17:28:20,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:20,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:21,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:28:21,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:21,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:28:21,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:28:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-18 17:28:24,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:24,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:28:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:28:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:28:24,482 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-18 17:28:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:25,391 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-18 17:28:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:28:25,391 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-18 17:28:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:25,392 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:28:25,392 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:28:25,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:28:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:28:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 17:28:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 17:28:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-18 17:28:25,396 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-18 17:28:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:25,397 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-18 17:28:25,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:28:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-18 17:28:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 17:28:25,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:25,398 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-18 17:28:25,398 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-18 17:28:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:25,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:25,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:28:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:26,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:26,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:26,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:26,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:26,897 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-18 17:28:26,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:26,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:26,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:26,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:28:26,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:28:29,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:29,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-18 17:28:29,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:29,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:28:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:28:29,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:29,815 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-18 17:28:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:30,066 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-18 17:28:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:28:30,066 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-18 17:28:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:30,067 INFO L225 Difference]: With dead ends: 163 [2019-01-18 17:28:30,067 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:28:30,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:28:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 17:28:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 17:28:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-18 17:28:30,071 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-18 17:28:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:30,071 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-18 17:28:30,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:28:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-18 17:28:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 17:28:30,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:30,072 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-18 17:28:30,072 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-18 17:28:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:30,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:30,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:30,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:28:32,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:32,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:32,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:32,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:32,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:32,108 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-18 17:28:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:32,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:32,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:28:32,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:28:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-18 17:28:35,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:28:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:28:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:28:35,133 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-18 17:28:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:35,373 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-18 17:28:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:28:35,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-18 17:28:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:35,374 INFO L225 Difference]: With dead ends: 166 [2019-01-18 17:28:35,374 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:28:35,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:28:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:28:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 17:28:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:28:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-18 17:28:35,378 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-18 17:28:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:35,378 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-18 17:28:35,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:28:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-18 17:28:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 17:28:35,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:35,379 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-18 17:28:35,379 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:35,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-18 17:28:35,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:35,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:35,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:28:37,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:37,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:37,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:37,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:37,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:37,004 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-18 17:28:37,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:37,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:38,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:28:38,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:38,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:28:38,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:28:41,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:41,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-18 17:28:41,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:41,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:28:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:28:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:41,486 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-18 17:28:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:41,756 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-18 17:28:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:28:41,757 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-18 17:28:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:41,757 INFO L225 Difference]: With dead ends: 169 [2019-01-18 17:28:41,757 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:28:41,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:28:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 17:28:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:28:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-18 17:28:41,760 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-18 17:28:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-18 17:28:41,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:28:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-18 17:28:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 17:28:41,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:41,761 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-18 17:28:41,762 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-18 17:28:41,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:41,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:41,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:41,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:28:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:42,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:42,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:42,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:42,915 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-18 17:28:42,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:42,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:43,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:43,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:43,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:28:43,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:28:46,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:46,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-18 17:28:46,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:46,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:28:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:28:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:46,224 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-18 17:28:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:46,590 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-18 17:28:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:28:46,590 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-18 17:28:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:46,591 INFO L225 Difference]: With dead ends: 172 [2019-01-18 17:28:46,591 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:28:46,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:28:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-18 17:28:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 17:28:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-18 17:28:46,595 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-18 17:28:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:46,596 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-18 17:28:46,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:28:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-18 17:28:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 17:28:46,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:46,597 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-18 17:28:46,597 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-18 17:28:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:28:47,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:47,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:47,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:47,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:47,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:47,831 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-18 17:28:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:47,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:47,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:28:47,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:28:51,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:51,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-18 17:28:51,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:51,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:28:51,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:28:51,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:28:51,915 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-18 17:28:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:52,346 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-18 17:28:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:28:52,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-18 17:28:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:52,347 INFO L225 Difference]: With dead ends: 175 [2019-01-18 17:28:52,347 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 17:28:52,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:28:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 17:28:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-18 17:28:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 17:28:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-18 17:28:52,351 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-18 17:28:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-18 17:28:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:28:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-18 17:28:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-18 17:28:52,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:52,352 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-18 17:28:52,352 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-18 17:28:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:52,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:28:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:53,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:53,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:53,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:53,702 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-18 17:28:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:53,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:54,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:28:54,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:54,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:28:54,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:28:58,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-18 17:28:58,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:58,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:28:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:28:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:28:58,562 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-18 17:28:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:58,903 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-18 17:28:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:28:58,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-18 17:28:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:58,904 INFO L225 Difference]: With dead ends: 178 [2019-01-18 17:28:58,904 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:28:58,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:28:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:28:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-18 17:28:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-18 17:28:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-18 17:28:58,907 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-18 17:28:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:58,908 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-18 17:28:58,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:28:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-18 17:28:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-18 17:28:58,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:58,909 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-18 17:28:58,909 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-18 17:28:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:29:00,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:00,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:00,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:00,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,212 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-18 17:29:00,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:00,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:00,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:00,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:00,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:29:00,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:29:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-18 17:29:04,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:29:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:29:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:29:04,079 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-18 17:29:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:04,390 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-18 17:29:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:29:04,391 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-18 17:29:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:04,391 INFO L225 Difference]: With dead ends: 181 [2019-01-18 17:29:04,392 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 17:29:04,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:29:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 17:29:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-18 17:29:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-18 17:29:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-18 17:29:04,396 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-18 17:29:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:04,396 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-18 17:29:04,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:29:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-18 17:29:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-18 17:29:04,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:04,397 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-18 17:29:04,398 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:04,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-18 17:29:04,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:04,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:04,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:04,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:29:05,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:05,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:05,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:05,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:05,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:05,881 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-18 17:29:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:05,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:05,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:29:05,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:29:09,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:09,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-18 17:29:09,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:09,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:29:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:29:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:29:09,865 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-18 17:29:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:10,238 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-18 17:29:10,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:29:10,238 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-18 17:29:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:10,239 INFO L225 Difference]: With dead ends: 184 [2019-01-18 17:29:10,239 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 17:29:10,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 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-18 17:29:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 17:29:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-18 17:29:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-18 17:29:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-18 17:29:10,243 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-18 17:29:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:10,244 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-18 17:29:10,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:29:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-18 17:29:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-18 17:29:10,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:10,245 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-18 17:29:10,245 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-18 17:29:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:10,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:10,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:29:11,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:11,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:11,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:11,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:11,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:11,669 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-18 17:29:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:11,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:12,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-18 17:29:12,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:12,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:29:12,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:29:16,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:16,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-18 17:29:16,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:16,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:29:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:29:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:29:16,591 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-18 17:29:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:16,930 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-18 17:29:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:29:16,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-18 17:29:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:16,931 INFO L225 Difference]: With dead ends: 187 [2019-01-18 17:29:16,931 INFO L226 Difference]: Without dead ends: 125 [2019-01-18 17:29:16,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:29:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-18 17:29:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-18 17:29:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-18 17:29:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-18 17:29:16,936 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-18 17:29:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-18 17:29:16,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:29:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-18 17:29:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-18 17:29:16,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:16,937 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-18 17:29:16,937 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-18 17:29:16,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:16,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:16,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:29:18,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:18,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:18,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:18,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:18,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:18,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 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-18 17:29:18,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:18,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:18,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:18,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:18,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:29:18,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:29:22,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:22,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-18 17:29:22,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:22,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:29:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:29:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:29:22,908 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-18 17:29:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:23,214 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-18 17:29:23,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:29:23,215 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-18 17:29:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:23,216 INFO L225 Difference]: With dead ends: 190 [2019-01-18 17:29:23,216 INFO L226 Difference]: Without dead ends: 127 [2019-01-18 17:29:23,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:29:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-18 17:29:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-18 17:29:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-18 17:29:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-18 17:29:23,221 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-18 17:29:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:23,222 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-18 17:29:23,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:29:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-18 17:29:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-18 17:29:23,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:23,223 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-18 17:29:23,223 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-18 17:29:23,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:23,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:23,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:29:24,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:24,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:24,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:24,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:24,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:24,640 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-18 17:29:24,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:24,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:24,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:29:24,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:29:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:29,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-18 17:29:29,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:29,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:29:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:29:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:29,071 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-18 17:29:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:29,448 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-18 17:29:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:29:29,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-18 17:29:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:29,448 INFO L225 Difference]: With dead ends: 193 [2019-01-18 17:29:29,449 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 17:29:29,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 17:29:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-18 17:29:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-18 17:29:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-18 17:29:29,453 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-18 17:29:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:29,453 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-18 17:29:29,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:29:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-18 17:29:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-18 17:29:29,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:29,454 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-18 17:29:29,454 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-18 17:29:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:29,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:29,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:29:30,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:30,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:30,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:30,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:30,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:30,916 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-18 17:29:30,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:30,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:31,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 17:29:31,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:31,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:29:31,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:29:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-18 17:29:36,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:29:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:29:36,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:29:36,339 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-18 17:29:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:36,730 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-18 17:29:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:29:36,730 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-18 17:29:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:36,731 INFO L225 Difference]: With dead ends: 196 [2019-01-18 17:29:36,731 INFO L226 Difference]: Without dead ends: 131 [2019-01-18 17:29:36,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:29:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-18 17:29:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-18 17:29:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-18 17:29:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-18 17:29:36,735 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-18 17:29:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:36,735 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-18 17:29:36,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:29:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-18 17:29:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-18 17:29:36,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:36,736 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-18 17:29:36,737 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-18 17:29:36,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:36,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:36,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:29:38,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:38,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:38,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:38,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:38,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:38,562 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-18 17:29:38,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:38,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:38,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:38,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:38,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:29:38,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:29:43,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:43,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-18 17:29:43,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:29:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:29:43,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:29:43,220 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-18 17:29:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:43,657 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-18 17:29:43,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:29:43,658 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-18 17:29:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:43,658 INFO L225 Difference]: With dead ends: 199 [2019-01-18 17:29:43,659 INFO L226 Difference]: Without dead ends: 133 [2019-01-18 17:29:43,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:29:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-18 17:29:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-18 17:29:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-18 17:29:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-18 17:29:43,663 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-18 17:29:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:43,663 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-18 17:29:43,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:29:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-18 17:29:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-18 17:29:43,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:43,664 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-18 17:29:43,664 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-18 17:29:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:43,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:43,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:43,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:43,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:29:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:45,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:45,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:45,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:45,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:45,244 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-18 17:29:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:45,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:45,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:29:45,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:29:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-18 17:29:50,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:50,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:29:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:29:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:29:50,207 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-18 17:29:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:50,681 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-18 17:29:50,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:29:50,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-18 17:29:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:50,682 INFO L225 Difference]: With dead ends: 202 [2019-01-18 17:29:50,682 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:29:50,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:29:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:29:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-18 17:29:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-18 17:29:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-18 17:29:50,686 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-18 17:29:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:50,686 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-18 17:29:50,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:29:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-18 17:29:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-18 17:29:50,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:50,688 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-18 17:29:50,688 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-18 17:29:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:50,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:29:52,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:52,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:52,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:52,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:52,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:52,289 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-18 17:29:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:52,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:55,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 17:29:55,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:55,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:29:55,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:30:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-18 17:30:00,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:00,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:30:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:30:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:30:00,041 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-18 17:30:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:00,428 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-18 17:30:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:30:00,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-18 17:30:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:00,429 INFO L225 Difference]: With dead ends: 205 [2019-01-18 17:30:00,429 INFO L226 Difference]: Without dead ends: 137 [2019-01-18 17:30:00,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:30:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-18 17:30:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-18 17:30:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:30:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-18 17:30:00,432 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-18 17:30:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:00,432 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-18 17:30:00,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:30:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-18 17:30:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-18 17:30:00,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:00,433 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-18 17:30:00,433 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-18 17:30:00,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:00,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:00,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:30:02,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:02,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:02,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:02,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:02,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:02,661 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-18 17:30:02,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:02,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:02,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:02,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:02,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:30:02,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:30:07,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:07,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-18 17:30:07,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:07,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:30:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:30:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:30:07,957 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-18 17:30:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:08,458 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-18 17:30:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:30:08,458 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-18 17:30:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:08,459 INFO L225 Difference]: With dead ends: 208 [2019-01-18 17:30:08,459 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 17:30:08,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:30:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 17:30:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-18 17:30:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-18 17:30:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-18 17:30:08,462 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-18 17:30:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:08,462 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-18 17:30:08,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:30:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-18 17:30:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-18 17:30:08,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:08,463 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-18 17:30:08,463 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-18 17:30:08,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:08,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:08,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:30:10,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:10,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:10,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:10,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:10,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:10,226 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-18 17:30:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:10,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:10,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:30:10,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:30:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-18 17:30:15,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:15,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:30:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:30:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:30:15,424 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-18 17:30:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:15,925 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-18 17:30:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:30:15,925 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-18 17:30:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:15,926 INFO L225 Difference]: With dead ends: 211 [2019-01-18 17:30:15,926 INFO L226 Difference]: Without dead ends: 141 [2019-01-18 17:30:15,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 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-18 17:30:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-18 17:30:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-18 17:30:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-18 17:30:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-18 17:30:15,930 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-18 17:30:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:15,930 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-18 17:30:15,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:30:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-18 17:30:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-18 17:30:15,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:15,931 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-18 17:30:15,931 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-18 17:30:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:15,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:15,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:30:17,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:17,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:17,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:17,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:17,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:17,718 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-18 17:30:17,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:17,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:21,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-18 17:30:21,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:21,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:30:21,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:30:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-18 17:30:26,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:30:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:30:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:30:26,245 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-18 17:30:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:26,783 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-18 17:30:26,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:30:26,783 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-18 17:30:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:26,784 INFO L225 Difference]: With dead ends: 214 [2019-01-18 17:30:26,784 INFO L226 Difference]: Without dead ends: 143 [2019-01-18 17:30:26,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:30:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-18 17:30:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-18 17:30:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-18 17:30:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-18 17:30:26,787 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-18 17:30:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:26,787 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-18 17:30:26,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:30:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-18 17:30:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-18 17:30:26,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:26,788 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-18 17:30:26,788 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-18 17:30:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:26,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:26,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:30:28,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:28,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:28,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:28,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:28,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:28,568 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-18 17:30:28,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:28,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:28,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:28,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:28,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:30:28,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:30:34,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:34,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-18 17:30:34,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:34,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:30:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:30:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:34,341 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-18 17:30:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:34,836 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-18 17:30:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:30:34,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-18 17:30:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:34,837 INFO L225 Difference]: With dead ends: 217 [2019-01-18 17:30:34,837 INFO L226 Difference]: Without dead ends: 145 [2019-01-18 17:30:34,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-18 17:30:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-18 17:30:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-18 17:30:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-18 17:30:34,842 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-18 17:30:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:34,842 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-18 17:30:34,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:30:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-18 17:30:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-18 17:30:34,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:34,844 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-18 17:30:34,844 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-18 17:30:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:34,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:34,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:30:36,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:36,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:36,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:36,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:36,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:36,664 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-18 17:30:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:36,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:36,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:30:36,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:30:42,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-18 17:30:42,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:42,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:30:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:30:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:30:42,236 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-18 17:30:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:42,681 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-18 17:30:42,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:30:42,682 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-18 17:30:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:42,683 INFO L225 Difference]: With dead ends: 220 [2019-01-18 17:30:42,683 INFO L226 Difference]: Without dead ends: 147 [2019-01-18 17:30:42,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:30:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-18 17:30:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-18 17:30:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-18 17:30:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-18 17:30:42,688 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-18 17:30:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:42,688 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-18 17:30:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:30:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-18 17:30:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-18 17:30:42,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:42,689 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-18 17:30:42,689 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-18 17:30:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:42,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:30:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:44,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:44,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:44,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:44,883 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-18 17:30:44,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:44,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:47,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-18 17:30:47,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:47,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:30:47,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:30:53,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:53,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-18 17:30:53,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:53,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:30:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:30:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:30:53,320 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-18 17:30:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:53,909 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-18 17:30:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:30:53,909 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-18 17:30:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:53,910 INFO L225 Difference]: With dead ends: 223 [2019-01-18 17:30:53,910 INFO L226 Difference]: Without dead ends: 149 [2019-01-18 17:30:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:30:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-18 17:30:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-18 17:30:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-18 17:30:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-18 17:30:53,914 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-18 17:30:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-18 17:30:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:30:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-18 17:30:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-18 17:30:53,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:53,916 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-18 17:30:53,916 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-18 17:30:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:53,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:53,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:30:56,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:56,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:56,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:56,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:56,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:56,077 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-18 17:30:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:56,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:56,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:56,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:56,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:30:56,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:31:01,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:01,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-18 17:31:01,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:31:01,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:31:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:31:01,908 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-18 17:31:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:02,471 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-18 17:31:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:31:02,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-18 17:31:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:02,472 INFO L225 Difference]: With dead ends: 226 [2019-01-18 17:31:02,472 INFO L226 Difference]: Without dead ends: 151 [2019-01-18 17:31:02,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:31:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-18 17:31:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-18 17:31:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-18 17:31:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-18 17:31:02,477 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-18 17:31:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-18 17:31:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:31:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-18 17:31:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-18 17:31:02,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:02,478 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-18 17:31:02,479 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-18 17:31:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:02,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:02,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:31:04,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:04,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:04,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:04,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:04,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:04,707 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-18 17:31:04,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:04,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:04,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:31:04,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:31:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-18 17:31:10,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:10,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:31:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:31:10,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:31:10,763 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-18 17:31:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:11,290 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-18 17:31:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:31:11,290 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-18 17:31:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:11,291 INFO L225 Difference]: With dead ends: 229 [2019-01-18 17:31:11,291 INFO L226 Difference]: Without dead ends: 153 [2019-01-18 17:31:11,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:31:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-18 17:31:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-18 17:31:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-18 17:31:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-18 17:31:11,295 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-18 17:31:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-18 17:31:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:31:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-18 17:31:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-18 17:31:11,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:11,296 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-18 17:31:11,296 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-18 17:31:11,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:31:13,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:13,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:13,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:13,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,373 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-18 17:31:13,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:13,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:15,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 17:31:15,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:15,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:31:15,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:31:21,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:21,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-18 17:31:21,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:21,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:31:21,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:31:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:31:21,728 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-18 17:31:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:22,350 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-18 17:31:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:31:22,350 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-18 17:31:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:22,351 INFO L225 Difference]: With dead ends: 232 [2019-01-18 17:31:22,351 INFO L226 Difference]: Without dead ends: 155 [2019-01-18 17:31:22,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 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-18 17:31:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-18 17:31:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-18 17:31:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-18 17:31:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-18 17:31:22,356 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-18 17:31:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:22,356 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-18 17:31:22,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:31:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-18 17:31:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-18 17:31:22,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:22,358 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-18 17:31:22,358 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-18 17:31:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:22,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:22,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:31:24,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:24,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:24,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:24,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,414 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-18 17:31:24,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:24,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:24,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:24,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:24,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:31:24,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:31:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-18 17:31:30,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:31:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:31:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:31:30,985 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-18 17:31:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:31,692 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-18 17:31:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:31:31,693 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-18 17:31:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:31,693 INFO L225 Difference]: With dead ends: 235 [2019-01-18 17:31:31,693 INFO L226 Difference]: Without dead ends: 157 [2019-01-18 17:31:31,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:31:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-18 17:31:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-18 17:31:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-18 17:31:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-18 17:31:31,697 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-18 17:31:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:31,697 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-18 17:31:31,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:31:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-18 17:31:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-18 17:31:31,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:31,698 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-18 17:31:31,698 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-18 17:31:31,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:31,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:31,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:31:33,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:33,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:33,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:33,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,894 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-18 17:31:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:33,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:34,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:31:34,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:31:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-18 17:31:40,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:40,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:31:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:31:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:31:40,617 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-18 17:31:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:41,231 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-18 17:31:41,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:31:41,232 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-18 17:31:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:41,233 INFO L225 Difference]: With dead ends: 238 [2019-01-18 17:31:41,233 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:31:41,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:31:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:31:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-18 17:31:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-18 17:31:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-18 17:31:41,237 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-18 17:31:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:41,237 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-18 17:31:41,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:31:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-18 17:31:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-18 17:31:41,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:41,238 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-18 17:31:41,238 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-18 17:31:41,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:41,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:41,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:31:43,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:43,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:43,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:43,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:43,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:43,511 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-18 17:31:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:43,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:47,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 17:31:47,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:47,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:31:47,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:31:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:54,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-18 17:31:54,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:54,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:31:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:31:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:54,324 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-18 17:31:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:55,064 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-18 17:31:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:31:55,064 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-18 17:31:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:55,065 INFO L225 Difference]: With dead ends: 241 [2019-01-18 17:31:55,065 INFO L226 Difference]: Without dead ends: 161 [2019-01-18 17:31:55,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-18 17:31:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-18 17:31:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-18 17:31:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-18 17:31:55,071 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-18 17:31:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:55,071 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-18 17:31:55,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:31:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-18 17:31:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-18 17:31:55,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:55,072 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-18 17:31:55,072 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-18 17:31:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:55,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:55,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:31:57,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:57,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:57,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:57,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:57,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:57,566 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-18 17:31:57,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:57,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:57,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:57,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:57,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:31:57,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:32:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-18 17:32:04,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:32:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:32:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:32:04,409 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-18 17:32:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:05,230 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-18 17:32:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:32:05,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-18 17:32:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:05,231 INFO L225 Difference]: With dead ends: 244 [2019-01-18 17:32:05,231 INFO L226 Difference]: Without dead ends: 163 [2019-01-18 17:32:05,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:32:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-18 17:32:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-18 17:32:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-18 17:32:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-18 17:32:05,237 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-18 17:32:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:05,237 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-18 17:32:05,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:32:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-18 17:32:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-18 17:32:05,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:05,238 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-18 17:32:05,238 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:05,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:05,239 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-18 17:32:05,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:05,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:05,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:32:07,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:07,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:07,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:07,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,956 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-18 17:32:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:07,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:08,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:32:08,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:32:15,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:15,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-18 17:32:15,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:15,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:32:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:32:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:32:15,070 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-18 17:32:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:15,934 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-18 17:32:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:32:15,935 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-18 17:32:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:15,935 INFO L225 Difference]: With dead ends: 247 [2019-01-18 17:32:15,936 INFO L226 Difference]: Without dead ends: 165 [2019-01-18 17:32:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 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-18 17:32:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-18 17:32:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-18 17:32:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-18 17:32:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-18 17:32:15,939 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-18 17:32:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:15,939 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-18 17:32:15,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:32:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-18 17:32:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-18 17:32:15,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:15,941 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-18 17:32:15,941 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-18 17:32:15,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:15,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:32:18,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:18,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:18,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:18,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:18,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:18,483 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-18 17:32:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:18,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:21,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-18 17:32:21,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:21,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:32:21,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:32:28,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:28,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-18 17:32:28,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:28,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:32:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:32:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:32:28,822 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-18 17:32:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:29,630 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-18 17:32:29,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:32:29,630 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-18 17:32:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:29,631 INFO L225 Difference]: With dead ends: 250 [2019-01-18 17:32:29,631 INFO L226 Difference]: Without dead ends: 167 [2019-01-18 17:32:29,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:32:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-18 17:32:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-18 17:32:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-18 17:32:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-18 17:32:29,635 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-18 17:32:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:29,635 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-18 17:32:29,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:32:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-18 17:32:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-18 17:32:29,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:29,636 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-18 17:32:29,636 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-18 17:32:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:29,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:29,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:29,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:32:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:32,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:32,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:32,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:32,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:32,352 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-18 17:32:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:32,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:32,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:32,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:32,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:32:32,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:32:39,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:39,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-18 17:32:39,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:39,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:32:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:32:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:32:39,641 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-18 17:32:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:40,326 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-18 17:32:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:32:40,327 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-18 17:32:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:40,328 INFO L225 Difference]: With dead ends: 253 [2019-01-18 17:32:40,328 INFO L226 Difference]: Without dead ends: 169 [2019-01-18 17:32:40,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:32:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-18 17:32:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-18 17:32:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-18 17:32:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-18 17:32:40,331 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-18 17:32:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:40,332 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-18 17:32:40,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:32:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-18 17:32:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-18 17:32:40,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:40,332 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-18 17:32:40,333 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-18 17:32:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:40,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:32:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:43,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:43,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:43,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:43,037 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-18 17:32:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:43,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:43,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:32:43,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:32:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:50,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-18 17:32:50,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:50,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:32:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:32:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:32:50,423 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-18 17:32:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:51,321 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-18 17:32:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:32:51,321 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-18 17:32:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:51,322 INFO L225 Difference]: With dead ends: 256 [2019-01-18 17:32:51,322 INFO L226 Difference]: Without dead ends: 171 [2019-01-18 17:32:51,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:32:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-18 17:32:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-18 17:32:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-18 17:32:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-18 17:32:51,325 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-18 17:32:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-18 17:32:51,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:32:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-18 17:32:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-18 17:32:51,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:51,326 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-18 17:32:51,326 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-18 17:32:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:51,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:51,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:51,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:51,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:32:54,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:54,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:54,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:54,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:54,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:54,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 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-18 17:32:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:54,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:02,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-18 17:33:02,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:02,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:33:02,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:33:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-18 17:33:10,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:10,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:33:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:33:10,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:33:10,392 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-18 17:33:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:11,353 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-18 17:33:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:33:11,353 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-18 17:33:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:11,354 INFO L225 Difference]: With dead ends: 259 [2019-01-18 17:33:11,354 INFO L226 Difference]: Without dead ends: 173 [2019-01-18 17:33:11,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:33:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-18 17:33:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-18 17:33:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-18 17:33:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-18 17:33:11,357 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-18 17:33:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:11,358 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-18 17:33:11,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:33:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-18 17:33:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-18 17:33:11,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:11,359 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-18 17:33:11,359 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:11,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-18 17:33:11,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:11,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:11,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:33:14,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:14,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:14,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:14,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:14,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:14,250 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-18 17:33:14,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:14,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:33:14,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:14,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:14,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:33:14,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:33:22,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:22,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-18 17:33:22,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:22,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:33:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:33:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:33:22,105 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-18 17:33:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:23,125 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-18 17:33:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:33:23,125 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-18 17:33:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:23,126 INFO L225 Difference]: With dead ends: 262 [2019-01-18 17:33:23,126 INFO L226 Difference]: Without dead ends: 175 [2019-01-18 17:33:23,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 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-18 17:33:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-18 17:33:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-18 17:33:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-18 17:33:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-18 17:33:23,131 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-18 17:33:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:23,131 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-18 17:33:23,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:33:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-18 17:33:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-18 17:33:23,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:23,132 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-18 17:33:23,134 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-18 17:33:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:23,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:23,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:33:25,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:25,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:25,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:25,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:25,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:25,856 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-18 17:33:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:25,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:25,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:33:26,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:33:35,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:35,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-18 17:33:35,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:35,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:33:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:33:35,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:33:35,044 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-18 17:33:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:36,034 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-18 17:33:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:33:36,035 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-18 17:33:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:36,036 INFO L225 Difference]: With dead ends: 265 [2019-01-18 17:33:36,036 INFO L226 Difference]: Without dead ends: 177 [2019-01-18 17:33:36,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:33:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-18 17:33:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-18 17:33:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-18 17:33:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-18 17:33:36,040 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-18 17:33:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:36,040 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-18 17:33:36,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:33:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-18 17:33:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-18 17:33:36,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:36,042 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-18 17:33:36,042 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-18 17:33:36,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:36,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:36,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 17:33:39,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:39,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:39,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:39,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:39,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:39,140 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-18 17:33:39,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:39,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:48,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-18 17:33:48,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:48,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 17:33:48,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 17:33:56,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:56,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-18 17:33:56,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:56,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:33:56,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:33:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:33:56,470 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-18 17:33:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:57,354 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-18 17:33:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:33:57,355 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-18 17:33:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:57,356 INFO L225 Difference]: With dead ends: 268 [2019-01-18 17:33:57,356 INFO L226 Difference]: Without dead ends: 179 [2019-01-18 17:33:57,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 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-18 17:33:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-18 17:33:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-18 17:33:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-18 17:33:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-18 17:33:57,361 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-18 17:33:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:57,361 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-18 17:33:57,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:33:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-18 17:33:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-18 17:33:57,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:57,362 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-18 17:33:57,362 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-18 17:33:57,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:57,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:57,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 17:34:00,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:00,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:00,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:00,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:00,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:00,459 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-18 17:34:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:00,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:00,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:00,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:00,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 17:34:00,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 17:34:08,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-18 17:34:08,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:08,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 17:34:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 17:34:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:34:08,824 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-18 17:34:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:09,858 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-18 17:34:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-18 17:34:09,858 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-18 17:34:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:09,859 INFO L225 Difference]: With dead ends: 271 [2019-01-18 17:34:09,859 INFO L226 Difference]: Without dead ends: 181 [2019-01-18 17:34:09,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:34:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-18 17:34:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-18 17:34:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-18 17:34:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-18 17:34:09,863 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-18 17:34:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:09,863 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-18 17:34:09,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 17:34:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-18 17:34:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-18 17:34:09,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:09,864 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-18 17:34:09,864 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-18 17:34:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:09,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:09,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 17:34:12,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:12,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:12,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:12,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:12,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:12,621 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-18 17:34:12,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:12,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:12,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 17:34:12,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 17:34:21,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:21,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-18 17:34:21,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:21,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:34:21,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:34:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:34:21,642 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-18 17:34:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:22,543 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-18 17:34:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:34:22,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-18 17:34:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:22,544 INFO L225 Difference]: With dead ends: 274 [2019-01-18 17:34:22,544 INFO L226 Difference]: Without dead ends: 183 [2019-01-18 17:34:22,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 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-18 17:34:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-18 17:34:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-18 17:34:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-18 17:34:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-18 17:34:22,548 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-18 17:34:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:22,549 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-18 17:34:22,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:34:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-18 17:34:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-18 17:34:22,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:22,549 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-18 17:34:22,550 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-18 17:34:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:22,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:22,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:22,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:22,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 17:34:25,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:25,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:25,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:25,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:25,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:25,802 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-18 17:34:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:25,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:30,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-18 17:34:30,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:30,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 17:34:30,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 17:34:39,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-18 17:34:39,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:39,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:34:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:34:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:34:39,246 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-18 17:34:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:40,045 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-18 17:34:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 17:34:40,046 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-18 17:34:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:40,046 INFO L225 Difference]: With dead ends: 277 [2019-01-18 17:34:40,047 INFO L226 Difference]: Without dead ends: 185 [2019-01-18 17:34:40,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:34:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-18 17:34:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-18 17:34:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-18 17:34:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-18 17:34:40,050 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-18 17:34:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:40,051 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-18 17:34:40,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:34:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-18 17:34:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-18 17:34:40,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:40,051 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-18 17:34:40,052 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-18 17:34:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:40,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:40,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 17:34:43,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:43,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:43,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:43,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:43,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:43,018 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-18 17:34:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:43,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:43,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:43,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:43,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 17:34:43,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 17:34:52,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:52,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-18 17:34:52,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:52,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 17:34:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 17:34:52,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:34:52,119 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-18 17:34:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:53,062 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-18 17:34:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 17:34:53,062 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-18 17:34:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:53,063 INFO L225 Difference]: With dead ends: 280 [2019-01-18 17:34:53,063 INFO L226 Difference]: Without dead ends: 187 [2019-01-18 17:34:53,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:34:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-18 17:34:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-18 17:34:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-18 17:34:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-18 17:34:53,068 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-18 17:34:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:53,068 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-18 17:34:53,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 17:34:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-18 17:34:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-18 17:34:53,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:53,069 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-18 17:34:53,069 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:53,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-18 17:34:53,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:53,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 17:34:56,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:56,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:56,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:56,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:56,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:56,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 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-18 17:34:56,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:56,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:56,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 17:34:56,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 17:35:05,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:05,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-18 17:35:05,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:05,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 17:35:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 17:35:05,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 17:35:05,763 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-18 17:35:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:07,000 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-18 17:35:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-18 17:35:07,000 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-18 17:35:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:07,001 INFO L225 Difference]: With dead ends: 283 [2019-01-18 17:35:07,001 INFO L226 Difference]: Without dead ends: 189 [2019-01-18 17:35:07,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 17:35:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-18 17:35:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-18 17:35:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-18 17:35:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-18 17:35:07,006 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-18 17:35:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:07,006 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-18 17:35:07,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 17:35:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-18 17:35:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-18 17:35:07,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:07,008 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-18 17:35:07,008 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-18 17:35:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:07,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:07,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 17:35:10,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:10,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:10,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:10,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:10,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:10,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 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-18 17:35:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:10,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:15,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-18 17:35:15,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:15,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 17:35:15,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 17:35:24,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:24,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-18 17:35:24,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:24,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:35:24,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:35:24,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 17:35:24,535 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-18 17:35:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:25,670 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-18 17:35:25,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 17:35:25,671 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-18 17:35:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:25,672 INFO L225 Difference]: With dead ends: 286 [2019-01-18 17:35:25,672 INFO L226 Difference]: Without dead ends: 191 [2019-01-18 17:35:25,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 17:35:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-18 17:35:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-18 17:35:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-18 17:35:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-18 17:35:25,676 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-18 17:35:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:25,677 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-18 17:35:25,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 17:35:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-18 17:35:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-18 17:35:25,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:25,678 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-18 17:35:25,678 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-18 17:35:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:25,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:25,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 17:35:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:28,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:28,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:28,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:28,787 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-18 17:35:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:28,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:28,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:28,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:28,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 17:35:28,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 17:35:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-18 17:35:38,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:38,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 17:35:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 17:35:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:35:38,367 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-18 17:35:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:39,692 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-18 17:35:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-18 17:35:39,692 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-18 17:35:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:39,693 INFO L225 Difference]: With dead ends: 289 [2019-01-18 17:35:39,693 INFO L226 Difference]: Without dead ends: 193 [2019-01-18 17:35:39,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:35:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-18 17:35:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-18 17:35:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-18 17:35:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-18 17:35:39,697 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-18 17:35:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:39,697 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-18 17:35:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 17:35:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-18 17:35:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-18 17:35:39,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:39,698 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-18 17:35:39,699 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-18 17:35:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:39,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:39,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 17:35:43,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:43,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:43,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:43,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:43,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:43,141 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-18 17:35:43,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:43,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:43,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 17:35:43,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 17:35:53,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-18 17:35:53,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 17:35:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 17:35:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 17:35:53,091 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-18 17:35:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:54,442 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-18 17:35:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 17:35:54,443 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-18 17:35:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:54,444 INFO L225 Difference]: With dead ends: 292 [2019-01-18 17:35:54,444 INFO L226 Difference]: Without dead ends: 195 [2019-01-18 17:35:54,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 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-18 17:35:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-18 17:35:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-18 17:35:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-18 17:35:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-18 17:35:54,448 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-18 17:35:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:54,448 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-18 17:35:54,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 17:35:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-18 17:35:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-18 17:35:54,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:54,449 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-18 17:35:54,449 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-18 17:35:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:54,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 17:35:57,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:57,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:57,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:57,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:57,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:57,985 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-18 17:35:57,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:57,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:03,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-18 17:36:03,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:03,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 17:36:03,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 17:36:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-18 17:36:13,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:13,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 17:36:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 17:36:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 17:36:13,877 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-18 17:36:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:15,357 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-18 17:36:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 17:36:15,357 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-18 17:36:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:15,358 INFO L225 Difference]: With dead ends: 295 [2019-01-18 17:36:15,358 INFO L226 Difference]: Without dead ends: 197 [2019-01-18 17:36:15,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 17:36:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-18 17:36:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-18 17:36:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-18 17:36:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-18 17:36:15,363 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-18 17:36:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:15,363 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-18 17:36:15,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 17:36:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-18 17:36:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-18 17:36:15,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:15,364 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-18 17:36:15,364 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-18 17:36:15,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:15,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:15,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 17:36:18,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:18,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:18,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:18,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:18,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:18,968 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-18 17:36:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:18,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:19,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:19,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:19,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 17:36:19,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 17:36:29,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:29,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-18 17:36:29,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:29,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 17:36:29,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 17:36:29,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:36:29,226 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-18 17:36:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:30,721 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-18 17:36:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 17:36:30,721 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-18 17:36:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:30,722 INFO L225 Difference]: With dead ends: 298 [2019-01-18 17:36:30,722 INFO L226 Difference]: Without dead ends: 199 [2019-01-18 17:36:30,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:36:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-18 17:36:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-18 17:36:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-18 17:36:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-18 17:36:30,726 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-18 17:36:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:30,726 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-18 17:36:30,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 17:36:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-18 17:36:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-18 17:36:30,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:30,727 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-18 17:36:30,727 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-18 17:36:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:30,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:30,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 17:36:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:34,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:34,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:34,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:34,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 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-18 17:36:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:34,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:34,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 17:36:34,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 17:36:45,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-18 17:36:45,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:45,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 17:36:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 17:36:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:36:45,073 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-18 17:36:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:46,304 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-18 17:36:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-18 17:36:46,304 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-18 17:36:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:46,305 INFO L225 Difference]: With dead ends: 301 [2019-01-18 17:36:46,305 INFO L226 Difference]: Without dead ends: 201 [2019-01-18 17:36:46,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:36:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-18 17:36:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-18 17:36:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-18 17:36:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-18 17:36:46,309 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-18 17:36:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:46,309 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-18 17:36:46,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 17:36:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-18 17:36:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-18 17:36:46,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:46,310 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-18 17:36:46,310 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-18 17:36:46,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 17:36:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:50,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:50,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:50,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:50,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:50,094 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-18 17:36:50,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:50,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:04,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-18 17:37:04,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:04,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 17:37:04,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 17:37:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-18 17:37:15,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:15,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 17:37:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 17:37:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 17:37:15,823 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-18 17:37:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:17,412 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-18 17:37:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 17:37:17,412 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-18 17:37:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:17,413 INFO L225 Difference]: With dead ends: 304 [2019-01-18 17:37:17,413 INFO L226 Difference]: Without dead ends: 203 [2019-01-18 17:37:17,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 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-18 17:37:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-18 17:37:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-18 17:37:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-18 17:37:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-18 17:37:17,417 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-18 17:37:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:17,417 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-18 17:37:17,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 17:37:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-18 17:37:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-18 17:37:17,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:17,418 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-18 17:37:17,418 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-18 17:37:17,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:17,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:17,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 17:37:21,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:21,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:21,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:21,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:21,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:21,234 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-18 17:37:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:21,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:21,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:21,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:21,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 17:37:21,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 17:37:32,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:32,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-18 17:37:32,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:32,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 17:37:32,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 17:37:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:37:32,109 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-18 17:37:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:33,755 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-18 17:37:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-18 17:37:33,755 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-18 17:37:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:33,756 INFO L225 Difference]: With dead ends: 307 [2019-01-18 17:37:33,756 INFO L226 Difference]: Without dead ends: 205 [2019-01-18 17:37:33,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:37:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-18 17:37:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-18 17:37:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-18 17:37:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-18 17:37:33,760 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-18 17:37:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:33,760 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-18 17:37:33,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 17:37:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-18 17:37:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-18 17:37:33,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:33,761 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-18 17:37:33,761 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-18 17:37:33,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:33,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:33,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 17:37:37,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:37,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:37,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:37,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:37,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:37,390 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-18 17:37:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:37,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:37,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 17:37:37,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 17:37:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-18 17:37:48,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:48,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 17:37:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 17:37:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 17:37:48,530 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-18 17:37:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:50,078 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-18 17:37:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 17:37:50,079 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-18 17:37:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:50,080 INFO L225 Difference]: With dead ends: 310 [2019-01-18 17:37:50,080 INFO L226 Difference]: Without dead ends: 207 [2019-01-18 17:37:50,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 17:37:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-18 17:37:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-18 17:37:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-18 17:37:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-18 17:37:50,085 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-18 17:37:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:50,085 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-18 17:37:50,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 17:37:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-18 17:37:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-18 17:37:50,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:50,087 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-18 17:37:50,087 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-18 17:37:50,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:50,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 17:37:53,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:53,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:53,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:53,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:53,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:53,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 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-18 17:37:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:53,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:12,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-18 17:38:12,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:12,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 17:38:12,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 17:38:23,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:23,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-18 17:38:23,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:23,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 17:38:23,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 17:38:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:38:23,743 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-18 17:38:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:25,499 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-18 17:38:25,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 17:38:25,499 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-18 17:38:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:25,500 INFO L225 Difference]: With dead ends: 313 [2019-01-18 17:38:25,500 INFO L226 Difference]: Without dead ends: 209 [2019-01-18 17:38:25,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:38:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-18 17:38:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-18 17:38:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-18 17:38:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-18 17:38:25,507 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-18 17:38:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:25,507 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-18 17:38:25,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 17:38:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-18 17:38:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-18 17:38:25,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:25,508 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-18 17:38:25,509 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-18 17:38:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 17:38:29,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:29,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:29,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:29,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,241 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-18 17:38:29,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:29,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:29,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:29,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:29,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 17:38:29,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 17:38:41,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:41,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-18 17:38:41,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:41,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 17:38:41,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 17:38:41,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:38:41,164 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-18 17:38:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:42,690 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-18 17:38:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 17:38:42,691 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-18 17:38:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:42,691 INFO L225 Difference]: With dead ends: 316 [2019-01-18 17:38:42,692 INFO L226 Difference]: Without dead ends: 211 [2019-01-18 17:38:42,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:38:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-18 17:38:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-18 17:38:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-18 17:38:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-18 17:38:42,698 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-18 17:38:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-18 17:38:42,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 17:38:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-18 17:38:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-18 17:38:42,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:42,700 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-18 17:38:42,700 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-18 17:38:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:42,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:42,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 17:38:46,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:46,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:46,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:46,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:46,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:46,974 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-18 17:38:46,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:46,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:47,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 17:38:47,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 17:38:58,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:58,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-18 17:38:58,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:58,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 17:38:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 17:38:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 17:38:58,930 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-18 17:39:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:00,687 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-18 17:39:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-18 17:39:00,695 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-18 17:39:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:00,696 INFO L225 Difference]: With dead ends: 319 [2019-01-18 17:39:00,696 INFO L226 Difference]: Without dead ends: 213 [2019-01-18 17:39:00,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 17:39:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-18 17:39:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-18 17:39:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-18 17:39:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-18 17:39:00,709 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-18 17:39:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:00,711 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-18 17:39:00,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 17:39:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-18 17:39:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-18 17:39:00,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:00,712 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-18 17:39:00,712 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:00,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-18 17:39:00,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 17:39:04,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:04,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:04,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:04,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,797 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-18 17:39:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:04,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:13,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-18 17:39:13,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:13,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 17:39:13,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 17:39:25,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-18 17:39:25,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:25,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 17:39:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 17:39:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 17:39:25,026 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-18 17:39:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:26,446 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-18 17:39:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 17:39:26,447 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-18 17:39:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:26,447 INFO L225 Difference]: With dead ends: 322 [2019-01-18 17:39:26,447 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 17:39:26,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 17:39:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 17:39:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-18 17:39:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-18 17:39:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-18 17:39:26,453 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-18 17:39:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:26,453 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-18 17:39:26,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 17:39:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-18 17:39:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-18 17:39:26,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:26,454 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-18 17:39:26,455 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-18 17:39:26,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:26,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:26,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat