java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:26:35,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:26:35,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:26:35,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:26:35,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:26:35,900 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:26:35,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:26:35,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:26:35,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:26:35,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:26:35,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:26:35,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:26:35,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:26:35,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:26:35,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:26:35,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:26:35,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:26:35,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:26:35,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:26:35,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:26:35,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:26:35,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:26:35,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:26:35,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:26:35,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:26:35,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:26:35,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:26:35,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:26:35,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:26:35,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:26:35,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:26:35,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:26:35,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:26:35,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:26:35,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:26:35,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:26:35,955 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,975 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:26:35,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:26:35,979 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:26:35,979 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:26:35,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:26:35,980 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:26:35,980 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:26:35,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:26:35,981 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:26:35,981 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:26:35,981 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:26:35,981 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:26:35,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:26:35,982 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:26:35,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:26:35,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:26:35,984 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:26:35,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:26:35,984 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:26:35,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:26:35,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:26:35,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:26:35,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:26:35,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:26:35,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:26:35,987 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:26:35,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:26:35,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:26:35,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:26:35,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:26:35,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:26:35,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:35,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:26:35,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:26:35,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:26:35,989 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:26:35,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:26:35,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:26:35,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:26:35,990 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:26:36,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:26:36,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:26:36,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:26:36,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:26:36,070 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:26:36,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-18 17:26:36,071 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-18 17:26:36,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:26:36,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:26:36,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:26:36,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:26:36,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:26:36,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:26:36,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:26:36,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:26:36,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:26:36,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.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,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:26:36,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:26:36,466 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:26:36,466 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-18 17:26:36,467 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36 BoogieIcfgContainer [2019-01-18 17:26:36,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:26:36,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:26:36,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:26:36,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:26:36,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/2) ... [2019-01-18 17:26:36,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6b4470 and model type array1.i_3.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,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36" (2/2) ... [2019-01-18 17:26:36,477 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-18 17:26:36,488 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:26:36,497 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:26:36,515 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:26:36,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:26:36,549 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:26:36,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:26:36,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:26:36,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:26:36,549 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:26:36,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:26:36,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:26:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 17:26:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:26:36,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:26:36,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-18 17:26:36,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:36,721 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,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:26:36,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:36,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:26:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:26:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:26:36,741 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-18 17:26:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:36,783 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-18 17:26:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:26:36,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:26:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:36,798 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:26:36,798 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 17:26:36,801 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,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 17:26:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 17:26:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 17:26:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 17:26:36,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 17:26:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:36,830 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 17:26:36,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:26:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 17:26:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:26:36,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:26:36,832 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-18 17:26:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:36,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:36,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:36,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:26:36,922 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-18 17:26:36,965 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:26:36,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:26:37,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:26:37,066 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:26:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:26:37,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,074 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,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-18 17:26:37,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:37,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:26:37,447 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-18 17:26:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,493 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 17:26:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:26:37,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:26:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,494 INFO L225 Difference]: With dead ends: 8 [2019-01-18 17:26:37,494 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 17:26:37,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:26:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 17:26:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 17:26:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:26:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 17:26:37,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-18 17:26:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,498 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 17:26:37,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 17:26:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:26:37,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,499 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:26:37,499 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-18 17:26:37,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:37,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:37,570 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,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,571 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,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:37,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:37,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:26:37,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:37,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:37,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-18 17:26:37,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:37,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:26:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:26:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:26:37,684 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-18 17:26:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,751 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-18 17:26:37,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:26:37,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-18 17:26:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,752 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:26:37,752 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:26:37,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:26:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:26:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:26:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:26:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-18 17:26:37,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-18 17:26:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,756 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-18 17:26:37,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:26:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-18 17:26:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:26:37,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,757 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-18 17:26:37,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,758 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-18 17:26:37,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:37,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:38,021 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,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,021 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,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:38,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:38,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:38,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:38,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:26:38,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:26:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:26:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:26:38,271 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-18 17:26:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:38,288 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-18 17:26:38,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:26:38,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-18 17:26:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:38,289 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:26:38,289 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 17:26:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:26:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 17:26:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 17:26:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:26:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 17:26:38,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-18 17:26:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 17:26:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:26:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 17:26:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:26:38,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:38,295 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-18 17:26:38,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-18 17:26:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:38,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:26:38,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,484 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,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:38,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-18 17:26:38,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:26:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:26:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:26:38,692 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-18 17:26:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:38,715 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-18 17:26:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:26:38,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:26:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:38,717 INFO L225 Difference]: With dead ends: 11 [2019-01-18 17:26:38,717 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:26:38,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:26:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:26:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:26:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:26:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-18 17:26:38,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-18 17:26:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:38,720 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-18 17:26:38,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:26:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-18 17:26:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:26:38,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:38,721 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-18 17:26:38,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-18 17:26:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:38,812 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,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,813 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:38,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:38,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:38,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:26:38,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:38,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:39,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-18 17:26:39,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:39,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:26:39,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:26:39,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:39,311 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-18 17:26:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,342 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 17:26:39,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:26:39,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-18 17:26:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,344 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:26:39,344 INFO L226 Difference]: Without dead ends: 10 [2019-01-18 17:26:39,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-18 17:26:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-18 17:26:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:26:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-18 17:26:39,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-18 17:26:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,348 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-18 17:26:39,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:26:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-18 17:26:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:26:39,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,349 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-18 17:26:39,349 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-18 17:26:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,475 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,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,476 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,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:39,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:39,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:39,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:39,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-18 17:26:39,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:39,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:26:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:26:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:39,677 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-18 17:26:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,700 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-18 17:26:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:26:39,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:26:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,702 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:26:39,703 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:26:39,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:26:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:26:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:26:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-18 17:26:39,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-18 17:26:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,706 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-18 17:26:39,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:26:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-18 17:26:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:26:39,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,707 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-18 17:26:39,707 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-18 17:26:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,858 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,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,858 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:39,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:39,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-18 17:26:40,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:26:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:26:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:26:40,150 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-18 17:26:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,175 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:26:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:26:40,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-18 17:26:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,179 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:26:40,179 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:26:40,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:26:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:26:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:26:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:26:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:26:40,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-18 17:26:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,182 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:26:40,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:26:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:26:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:26:40,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,183 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-18 17:26:40,183 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-18 17:26:40,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:40,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,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:26:40,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,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 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,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:40,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:40,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:26:40,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:40,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-18 17:26:40,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:26:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:26:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:26:40,531 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-18 17:26:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,562 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-18 17:26:40,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:26:40,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-18 17:26:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,563 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:26:40,563 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:26:40,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:26:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:26:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:26:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-18 17:26:40,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-18 17:26:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,568 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-18 17:26:40,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:26:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-18 17:26:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:26:40,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,569 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-18 17:26:40,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-18 17:26:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,805 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,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,805 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:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:40,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:40,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:40,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:40,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-18 17:26:41,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:26:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:26:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,078 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-18 17:26:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,108 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-18 17:26:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:26:41,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-18 17:26:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,109 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:26:41,109 INFO L226 Difference]: Without dead ends: 14 [2019-01-18 17:26:41,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-18 17:26:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-18 17:26:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:26:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-18 17:26:41,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-18 17:26:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,113 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-18 17:26:41,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:26:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-18 17:26:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:26:41,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,114 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-18 17:26:41,114 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-18 17:26:41,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:41,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:41,266 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,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,266 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:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:41,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-18 17:26:41,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:26:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:26:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:26:41,489 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-18 17:26:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,521 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-18 17:26:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:26:41,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-18 17:26:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,523 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:26:41,523 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:26:41,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:26:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:26:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:26:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:26:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-18 17:26:41,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-18 17:26:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,528 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-18 17:26:41,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:26:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-18 17:26:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:26:41,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,529 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-18 17:26:41,529 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-18 17:26:41,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:41,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:41,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:41,863 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,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,863 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:41,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:41,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:41,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:26:41,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:41,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:42,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-18 17:26:42,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:42,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:26:42,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:26:42,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:26:42,336 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-18 17:26:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:42,366 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-18 17:26:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:26:42,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-18 17:26:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:42,374 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:26:42,374 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:26:42,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:26:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:26:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-18 17:26:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:26:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:26:42,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-18 17:26:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:42,377 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:26:42,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:26:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:26:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:26:42,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:42,378 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-18 17:26:42,378 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-18 17:26:42,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:42,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:42,557 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,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,558 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:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:42,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:42,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:42,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:42,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:42,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-18 17:26:42,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:42,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:26:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:26:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:42,875 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-18 17:26:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:42,925 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-18 17:26:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:26:42,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-18 17:26:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:42,926 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:26:42,926 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:26:42,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:26:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:26:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:26:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-18 17:26:42,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-18 17:26:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:42,931 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-18 17:26:42,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:26:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-18 17:26:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:26:42,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:42,932 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-18 17:26:42,932 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-18 17:26:42,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:43,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:43,098 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,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,098 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:43,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:43,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:43,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-18 17:26:43,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:43,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:26:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:26:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:43,800 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-18 17:26:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:43,831 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:26:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:26:43,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-18 17:26:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:43,838 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:26:43,838 INFO L226 Difference]: Without dead ends: 18 [2019-01-18 17:26:43,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-18 17:26:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-18 17:26:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:26:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-18 17:26:43,841 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-18 17:26:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:43,842 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-18 17:26:43,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:26:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-18 17:26:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-18 17:26:43,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:43,842 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-18 17:26:43,842 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-18 17:26:43,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:43,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:43,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:44,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:44,227 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,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,227 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:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:44,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:44,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:26:44,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:44,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-18 17:26:44,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:44,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:26:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:26:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:26:44,954 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-18 17:26:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:44,987 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-18 17:26:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:26:44,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-18 17:26:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:44,989 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:26:44,989 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:26:44,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:26:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:26:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:26:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:26:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-18 17:26:44,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-18 17:26:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:44,994 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-18 17:26:44,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:26:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-18 17:26:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:26:44,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:44,995 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-18 17:26:44,996 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-18 17:26:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:45,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:45,264 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,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,265 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:45,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:45,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:45,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:45,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:45,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:45,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-18 17:26:45,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:45,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:26:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:26:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:45,989 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-18 17:26:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:46,023 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-18 17:26:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:26:46,024 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-18 17:26:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:46,025 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:26:46,025 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:26:46,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:26:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-18 17:26:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:26:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-18 17:26:46,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-18 17:26:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:46,030 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-18 17:26:46,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:26:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-18 17:26:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:26:46,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:46,030 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-18 17:26:46,031 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-18 17:26:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:46,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:46,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:46,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:46,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:46,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:46,531 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,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,531 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:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:46,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:46,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:46,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-18 17:26:47,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:47,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:26:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:26:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:26:47,210 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-18 17:26:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:47,237 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-18 17:26:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:26:47,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-18 17:26:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:47,238 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:26:47,238 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:26:47,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:26:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:26:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:26:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:26:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-18 17:26:47,242 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-18 17:26:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-18 17:26:47,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:26:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-18 17:26:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:26:47,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:47,243 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-18 17:26:47,244 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-18 17:26:47,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:47,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:47,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:47,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:47,425 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,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,425 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:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:47,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:47,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:26:47,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:47,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:47,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-18 17:26:48,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:26:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:26:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:48,240 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 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 24 states and 24 transitions. [2019-01-18 17:26:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:26:48,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-18 17:26:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:48,271 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:26:48,271 INFO L226 Difference]: Without dead ends: 22 [2019-01-18 17:26:48,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-18 17:26:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-18 17:26:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:26:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:26:48,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-18 17:26:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:48,277 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:26:48,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:26:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:26:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [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 [18, 1, 1, 1] [2019-01-18 17:26:48,278 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-18 17:26:48,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [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 L101 rtionOrderModulation]: Changing assertion order to 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,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:49,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:49,697 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,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,698 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:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:49,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:49,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:49,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:49,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-18 17:26:50,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:50,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:26:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:26:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:50,266 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-18 17:26:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:50,302 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-18 17:26:50,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:26:50,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-18 17:26:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:50,303 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:26:50,304 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:26:50,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:26:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:26:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:26:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-18 17:26:50,309 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-18 17:26:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:50,309 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-18 17:26:50,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:26:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-18 17:26:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:26:50,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:50,310 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-18 17:26:50,311 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-18 17:26:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:50,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:50,559 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,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,559 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:50,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:50,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:50,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-18 17:26:51,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:51,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:26:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:26:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:26:51,102 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-18 17:26:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:51,201 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:26:51,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:26:51,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-18 17:26:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:51,203 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:26:51,203 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:26:51,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:26:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:26:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-18 17:26:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:26:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-18 17:26:51,207 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-18 17:26:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:51,207 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-18 17:26:51,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:26:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-18 17:26:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:26:51,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:51,208 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-18 17:26:51,209 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-18 17:26:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:51,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:51,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:51,501 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:51,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,502 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:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:51,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:51,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:26:51,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:51,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:51,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:52,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-18 17:26:52,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:52,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:26:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:26:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:26:52,046 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-18 17:26:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:52,089 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-18 17:26:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:26:52,090 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-18 17:26:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:52,091 INFO L225 Difference]: With dead ends: 27 [2019-01-18 17:26:52,091 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:26:52,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:26:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:26:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:26:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:26:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-18 17:26:52,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-18 17:26:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:52,095 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-18 17:26:52,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:26:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-18 17:26:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:26:52,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:52,096 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-18 17:26:52,096 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-18 17:26:52,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:52,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:52,339 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,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:52,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:52,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:52,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:52,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-18 17:26:53,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:53,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:26:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:26:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:53,150 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-18 17:26:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:53,212 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-18 17:26:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:26:53,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-18 17:26:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:53,215 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:26:53,215 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 17:26:53,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 17:26:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-18 17:26:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:26:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:26:53,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-18 17:26:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:53,219 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:26:53,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:26:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:26:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:26:53,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:53,220 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-18 17:26:53,220 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-18 17:26:53,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:53,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:53,575 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,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,575 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:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:53,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:53,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-18 17:26:54,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:54,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:26:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:26:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:26:54,535 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-18 17:26:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:54,575 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-18 17:26:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:26:54,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-18 17:26:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:54,575 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:26:54,576 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:26:54,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:26:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:26:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:26:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:26:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-18 17:26:54,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-18 17:26:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:54,582 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-18 17:26:54,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:26:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-18 17:26:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:26:54,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:54,583 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-18 17:26:54,583 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-18 17:26:54,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:54,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:54,964 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,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:54,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:55,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:26:55,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:55,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:55,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-18 17:26:55,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:55,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:26:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:26:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:26:55,683 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-18 17:26:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:55,731 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:26:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:26:55,731 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-18 17:26:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:55,732 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:26:55,732 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:26:55,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:26:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:26:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-18 17:26:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:26:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-18 17:26:55,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-18 17:26:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:55,736 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-18 17:26:55,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:26:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-18 17:26:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:26:55,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:55,738 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-18 17:26:55,739 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-18 17:26:55,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:55,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:55,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:56,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:56,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:56,308 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:56,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,309 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:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:56,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:56,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:56,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:56,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:56,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:57,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:57,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-18 17:26:57,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:57,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:26:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:26:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:26:57,075 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-18 17:26:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:57,128 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-18 17:26:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:26:57,129 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-18 17:26:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:57,129 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:26:57,129 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:26:57,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 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:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:26:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:26:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:26:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-18 17:26:57,135 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-18 17:26:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:57,135 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-18 17:26:57,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:26:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-18 17:26:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:26:57,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:57,136 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-18 17:26:57,136 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-18 17:26:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:57,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:57,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:57,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:57,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:57,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:57,458 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,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:57,458 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:26:57,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:57,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:57,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:57,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:59,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:59,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-18 17:26:59,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:59,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:26:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:26:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:26:59,428 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-18 17:26:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:59,522 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-18 17:26:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:26:59,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-18 17:26:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:59,524 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:26:59,524 INFO L226 Difference]: Without dead ends: 30 [2019-01-18 17:26:59,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:26:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-18 17:26:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-18 17:26:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:26:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-18 17:26:59,527 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-18 17:26:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:59,527 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-18 17:26:59,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:26:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-18 17:26:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-18 17:26:59,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:59,528 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-18 17:26:59,528 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-18 17:26:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:00,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:00,130 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,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,130 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:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:00,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:00,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:27:00,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:00,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:00,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:01,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:01,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-18 17:27:01,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:01,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:27:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:27:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:27:01,104 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-18 17:27:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:01,269 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-18 17:27:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:27:01,270 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-18 17:27:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:01,271 INFO L225 Difference]: With dead ends: 33 [2019-01-18 17:27:01,271 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:27:01,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:27:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:27:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:27:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:27:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-18 17:27:01,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-18 17:27:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:01,275 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-18 17:27:01,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:27:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-18 17:27:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:27:01,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:01,276 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-18 17:27:01,276 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-18 17:27:01,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:02,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:02,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:02,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:27:02,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,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 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:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:02,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:02,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:02,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:02,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:02,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:03,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:03,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-18 17:27:03,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:03,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:27:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:27:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:03,150 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-18 17:27:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:03,183 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-18 17:27:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:27:03,184 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-18 17:27:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:03,185 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:27:03,185 INFO L226 Difference]: Without dead ends: 32 [2019-01-18 17:27:03,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-18 17:27:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-18 17:27:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:27:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:27:03,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-18 17:27:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:03,190 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:27:03,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:27:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:27:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:27:03,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:03,191 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-18 17:27:03,192 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-18 17:27:03,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:03,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:03,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:03,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:03,620 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:03,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:03,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 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:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:03,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:03,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:03,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:04,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:04,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-18 17:27:04,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:04,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:27:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:27:04,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:27:04,931 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-18 17:27:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:05,009 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-18 17:27:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:27:05,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-18 17:27:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:05,013 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:27:05,013 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:27:05,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:27:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:27:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:27:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:27:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-18 17:27:05,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-18 17:27:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:05,018 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-18 17:27:05,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:27:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-18 17:27:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:27:05,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:05,019 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-18 17:27:05,019 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-18 17:27:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:05,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:05,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:05,711 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,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,711 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:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:05,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:05,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:27:05,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:05,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:05,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:07,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-18 17:27:07,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:07,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:27:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:27:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:07,104 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-18 17:27:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:07,209 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:27:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:27:07,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-18 17:27:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:07,211 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:27:07,211 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:27:07,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:27:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-18 17:27:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:27:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-18 17:27:07,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-18 17:27:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:07,213 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-18 17:27:07,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:27:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-18 17:27:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-18 17:27:07,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:07,214 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-18 17:27:07,214 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-18 17:27:07,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:07,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:07,736 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,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,737 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:07,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:07,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:07,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:07,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:07,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:08,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:08,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-18 17:27:08,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:08,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:27:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:27:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:08,820 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-18 17:27:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:08,902 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-18 17:27:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:27:08,903 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-18 17:27:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:08,903 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:27:08,903 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:27:08,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 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:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:27:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:27:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:27:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-18 17:27:08,906 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-18 17:27:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:08,906 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-18 17:27:08,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:27:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-18 17:27:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:27:08,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:08,906 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-18 17:27:08,906 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-18 17:27:08,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:08,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:08,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:09,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:09,623 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,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,624 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:09,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:09,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:09,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:10,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:10,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-18 17:27:10,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:10,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:27:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:27:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:27:10,790 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-18 17:27:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:10,856 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-18 17:27:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:27:10,856 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-18 17:27:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:10,857 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:27:10,857 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 17:27:10,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:27:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 17:27:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-18 17:27:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:27:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:27:10,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-18 17:27:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:10,862 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:27:10,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:27:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:27:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:27:10,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:10,863 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-18 17:27:10,863 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-18 17:27:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:10,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:11,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:11,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:27:11,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,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 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:11,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:11,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:11,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:27:11,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:11,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:11,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:12,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:12,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-18 17:27:12,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:12,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:27:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:27:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:27:12,596 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-18 17:27:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:12,661 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-18 17:27:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:27:12,662 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-18 17:27:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:12,662 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:27:12,662 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:27:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:27:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:27:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:27:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:27:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-18 17:27:12,666 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-18 17:27:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:12,666 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-18 17:27:12,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:27:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-18 17:27:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:27:12,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:12,667 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-18 17:27:12,667 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-18 17:27:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:12,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:12,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:13,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:13,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:13,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:13,185 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:13,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:13,185 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:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:13,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:13,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:13,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:13,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:13,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:14,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:14,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-18 17:27:14,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:14,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:27:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:27:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:14,778 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-18 17:27:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:14,886 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:27:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:27:14,887 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-18 17:27:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:14,888 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:27:14,888 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:27:14,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:27:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-18 17:27:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:27:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-18 17:27:14,892 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-18 17:27:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:14,892 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-18 17:27:14,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:27:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-18 17:27:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:27:14,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:14,893 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-18 17:27:14,893 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-18 17:27:14,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:14,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:14,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:15,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:15,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:15,639 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:15,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:15,639 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:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:15,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:15,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:17,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:17,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-18 17:27:17,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:17,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:27:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:27:17,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:27:17,013 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-18 17:27:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:17,076 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-18 17:27:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:27:17,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-18 17:27:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:17,077 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:27:17,077 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:27:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:27:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:27:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:27:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:27:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-18 17:27:17,081 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-18 17:27:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-18 17:27:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:27:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-18 17:27:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:27:17,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:17,083 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-18 17:27:17,083 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-18 17:27:17,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:17,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:17,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:17,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:17,645 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:17,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:17,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:17,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:17,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:27:17,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:17,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:17,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:19,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:19,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-18 17:27:19,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:19,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:27:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:27:19,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:27:19,077 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-18 17:27:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:19,125 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-18 17:27:19,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:27:19,125 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-18 17:27:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:19,126 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:27:19,126 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:27:19,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:27:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:27:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-18 17:27:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:27:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-18 17:27:19,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-18 17:27:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:19,128 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-18 17:27:19,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:27:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-18 17:27:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:27:19,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:19,129 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-18 17:27:19,129 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-18 17:27:19,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:19,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:19,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:19,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:19,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:19,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:19,908 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:19,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:19,908 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:19,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:19,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:19,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:19,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:19,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:21,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:21,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-18 17:27:21,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:21,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:27:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:27:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:21,609 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-18 17:27:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:21,690 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-18 17:27:21,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:27:21,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-18 17:27:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:21,691 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:27:21,691 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:27:21,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:27:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:27:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:27:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-18 17:27:21,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-18 17:27:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:21,694 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-18 17:27:21,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:27:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-18 17:27:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:27:21,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:21,694 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-18 17:27:21,695 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-18 17:27:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:21,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:21,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:22,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:22,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:22,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:22,341 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:22,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:22,341 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:22,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:22,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:22,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:22,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:23,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:23,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-18 17:27:23,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:23,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:27:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:27:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:23,927 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-18 17:27:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:23,990 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-18 17:27:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:27:23,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-18 17:27:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:23,992 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:27:23,992 INFO L226 Difference]: Without dead ends: 42 [2019-01-18 17:27:23,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-18 17:27:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-18 17:27:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:27:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:27:23,995 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-18 17:27:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:27:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:27:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:27:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:27:23,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:23,996 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-18 17:27:23,996 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-18 17:27:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:24,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:24,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:24,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:24,942 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,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:24,942 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:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:24,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:25,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:27:25,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:25,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:25,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:26,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:26,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-18 17:27:26,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:26,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:27:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:27:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:27:26,706 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-18 17:27:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:26,768 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-18 17:27:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:27:26,769 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-18 17:27:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:26,769 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:27:26,770 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:27:26,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:27:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:27:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:27:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:27:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-18 17:27:26,773 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-18 17:27:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:26,773 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-18 17:27:26,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:27:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-18 17:27:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:27:26,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:26,774 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-18 17:27:26,774 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-18 17:27:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:26,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:26,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:26,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:26,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:27,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:27,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:27,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:27,503 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,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:27,503 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:27,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:27,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:27,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:27,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:27,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:27,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:29,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:29,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-18 17:27:29,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:29,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:27:29,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:27:29,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:29,258 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-18 17:27:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:29,327 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:27:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:27:29,327 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-18 17:27:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:29,328 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:27:29,328 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:27:29,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:27:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-18 17:27:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:27:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-18 17:27:29,330 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-18 17:27:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:29,331 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-18 17:27:29,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:27:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-18 17:27:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:27:29,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:29,331 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-18 17:27:29,331 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-18 17:27:29,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:29,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:29,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:30,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:30,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:30,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:30,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,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 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:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:30,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:30,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-18 17:27:32,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:27:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:27:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:27:32,185 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-18 17:27:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:32,275 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-18 17:27:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:27:32,277 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-18 17:27:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:32,278 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:27:32,278 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:27:32,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:27:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:27:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:27:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:27:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-18 17:27:32,280 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-18 17:27:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:32,280 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-18 17:27:32,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:27:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-18 17:27:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:27:32,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:32,281 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-18 17:27:32,281 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-18 17:27:32,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:33,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:33,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:33,030 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,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,030 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:33,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:33,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:33,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:27:33,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:33,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:33,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-18 17:27:35,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:35,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:27:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:27:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:35,356 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-18 17:27:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:35,426 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-18 17:27:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:27:35,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-18 17:27:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:35,427 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:27:35,428 INFO L226 Difference]: Without dead ends: 46 [2019-01-18 17:27:35,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-18 17:27:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-18 17:27:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:27:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:27:35,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-18 17:27:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:35,430 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:27:35,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:27:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:27:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:27:35,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:35,431 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-18 17:27:35,431 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-18 17:27:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:36,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:36,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:36,410 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,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,410 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:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:36,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:36,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:36,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:36,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:36,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:38,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:38,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-18 17:27:38,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:38,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:27:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:27:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:38,411 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-18 17:27:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:38,463 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-18 17:27:38,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:27:38,464 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-18 17:27:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:38,464 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:27:38,464 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:27:38,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:27:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:27:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:27:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-18 17:27:38,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-18 17:27:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:38,468 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-18 17:27:38,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:27:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-18 17:27:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:27:38,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:38,469 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-18 17:27:38,469 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-18 17:27:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:38,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:38,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:39,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:39,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:39,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:39,323 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:39,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:39,323 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:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:39,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:39,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:39,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:41,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-18 17:27:41,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:41,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:27:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:27:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:27:41,684 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-18 17:27:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:41,756 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:27:41,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:27:41,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-18 17:27:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:41,757 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:27:41,757 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:27:41,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:27:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:27:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-18 17:27:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:27:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-18 17:27:41,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-18 17:27:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:41,759 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-18 17:27:41,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:27:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-18 17:27:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:27:41,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:41,760 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-18 17:27:41,760 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-18 17:27:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:41,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:42,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:42,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:42,843 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:42,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,843 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:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:42,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:42,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:27:42,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:42,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:42,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:45,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:45,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-18 17:27:45,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:45,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:27:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:27:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:27:45,338 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-18 17:27:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:45,443 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-18 17:27:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:27:45,443 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-18 17:27:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:45,444 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:27:45,444 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:27:45,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 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:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:27:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:27:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:27:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-18 17:27:45,448 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-18 17:27:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:45,448 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-18 17:27:45,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:27:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-18 17:27:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:27:45,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:45,449 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-18 17:27:45,449 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-18 17:27:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:45,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:45,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:46,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:46,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:46,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:46,343 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:46,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:46,343 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:46,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:46,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:46,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:46,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:46,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:46,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:48,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-18 17:27:48,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:48,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:27:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:27:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:27:48,629 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-18 17:27:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:49,017 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-18 17:27:49,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:27:49,017 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-18 17:27:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:49,018 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:27:49,018 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:27:49,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:27:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:27:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-18 17:27:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 17:27:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-18 17:27:49,020 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-18 17:27:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:49,022 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-18 17:27:49,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:27:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-18 17:27:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-18 17:27:49,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:49,022 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-18 17:27:49,023 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-18 17:27:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:49,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:49,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:49,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:49,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:49,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:49,990 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:49,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:49,990 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:27:49,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:49,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:50,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:50,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:52,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-18 17:27:52,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:52,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:27:52,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:27:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:27:52,635 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-18 17:27:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:52,718 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-18 17:27:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:27:52,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-18 17:27:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:52,719 INFO L225 Difference]: With dead ends: 53 [2019-01-18 17:27:52,719 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:27:52,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:27:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:27:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:27:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:27:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-18 17:27:52,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-18 17:27:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:52,723 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-18 17:27:52,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:27:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-18 17:27:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:27:52,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:52,724 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-18 17:27:52,724 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-18 17:27:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:52,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:53,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:53,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:53,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:27:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:53,767 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:27:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:53,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:53,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:27:53,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:53,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:53,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-18 17:27:56,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:56,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:27:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:27:56,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:27:56,597 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-18 17:27:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:56,658 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-18 17:27:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:27:56,658 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-18 17:27:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:56,659 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:27:56,660 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:27:56,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 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:27:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:27:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-18 17:27:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:27:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:27:56,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-18 17:27:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:56,664 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:27:56,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:27:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:27:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:27:56,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:56,664 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-18 17:27:56,665 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-18 17:27:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:57,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:57,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:57,719 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,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,719 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:27:57,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:57,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:57,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:57,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:57,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-18 17:28:00,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:28:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:28:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:00,264 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-18 17:28:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:00,417 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-18 17:28:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:28:00,417 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-18 17:28:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:00,418 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:28:00,418 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:28:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:28:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:28:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:28:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-18 17:28:00,421 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-18 17:28:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:00,422 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-18 17:28:00,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:28:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-18 17:28:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:28:00,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:00,422 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-18 17:28:00,423 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-18 17:28:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:00,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:00,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:01,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:01,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:01,466 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:01,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,466 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:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:01,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:01,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:01,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:04,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:04,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-18 17:28:04,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:04,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:28:04,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:28:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:04,315 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-18 17:28:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:04,373 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:28:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:28:04,374 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-18 17:28:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:04,374 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:28:04,374 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:28:04,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:28:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-18 17:28:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:28:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-18 17:28:04,378 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-18 17:28:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:04,378 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-18 17:28:04,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:28:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-18 17:28:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-18 17:28:04,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:04,379 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-18 17:28:04,379 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-18 17:28:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:04,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:04,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:05,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:05,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:05,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:05,582 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:05,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:05,582 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:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:05,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:05,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:28:05,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:05,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:05,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:08,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:08,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-18 17:28:08,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:08,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:28:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:28:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:28:08,654 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-18 17:28:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:08,791 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-18 17:28:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:28:08,792 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-18 17:28:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:08,792 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:28:08,793 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:28:08,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:28:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:28:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:28:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:28:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-18 17:28:08,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-18 17:28:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-18 17:28:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:28:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-18 17:28:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:28:08,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:08,796 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-18 17:28:08,796 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-18 17:28:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:08,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:08,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:09,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:09,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:09,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:09,873 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:09,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:09,873 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:09,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:09,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:09,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:09,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:09,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:09,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-18 17:28:13,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:13,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:28:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:28:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:13,077 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-18 17:28:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:13,167 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-18 17:28:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:28:13,168 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-18 17:28:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:13,168 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:28:13,169 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:28:13,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:28:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-18 17:28:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:28:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:28:13,171 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-18 17:28:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:28:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:28:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:28:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:28:13,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:13,172 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-18 17:28:13,172 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-18 17:28:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:13,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:13,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:14,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:14,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:14,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:14,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:28:14,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:14,288 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:14,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:14,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:14,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:14,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:17,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:17,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-18 17:28:17,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:17,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:28:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:28:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:28:17,536 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-18 17:28:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:17,634 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-18 17:28:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:28:17,634 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-18 17:28:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:17,635 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:28:17,635 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:28:17,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:28:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:28:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:28:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:28:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-18 17:28:17,638 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-18 17:28:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:17,638 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-18 17:28:17,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:28:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-18 17:28:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:28:17,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:17,639 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-18 17:28:17,639 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-18 17:28:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:17,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:18,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:18,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:18,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:18,763 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:18,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:18,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:18,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:18,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:28:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:18,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:18,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:22,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-18 17:28:22,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:22,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:28:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:28:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:22,197 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-18 17:28:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:22,263 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:28:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:28:22,264 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-18 17:28:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:22,265 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:28:22,265 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:28:22,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:28:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-18 17:28:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:28:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-18 17:28:22,269 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-18 17:28:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:22,269 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-18 17:28:22,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:28:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-18 17:28:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-18 17:28:22,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:22,270 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-18 17:28:22,270 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-18 17:28:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:22,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:22,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:23,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:23,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:23,458 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:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:23,458 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:23,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:23,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:23,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:23,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:23,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:23,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-18 17:28:26,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:28:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:28:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:26,807 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-18 17:28:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:26,899 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-18 17:28:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:28:26,899 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-18 17:28:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:26,900 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:28:26,900 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:28:26,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:28:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:28:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:28:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-18 17:28:26,904 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-18 17:28:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:26,904 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-18 17:28:26,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:28:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-18 17:28:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:28:26,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:26,905 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-18 17:28:26,905 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-18 17:28:26,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:26,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:28,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:28,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:28,136 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:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:28,136 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:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:28,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:28,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:28,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:31,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:31,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-18 17:28:31,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:28:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:28:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:28:31,728 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-18 17:28:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:31,843 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-18 17:28:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:28:31,843 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-18 17:28:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:31,843 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:28:31,843 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:28:31,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:28:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:28:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-18 17:28:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:28:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-18 17:28:31,847 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-18 17:28:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:31,847 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-18 17:28:31,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:28:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-18 17:28:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:28:31,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:31,847 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-18 17:28:31,848 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-18 17:28:31,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:31,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:33,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:33,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:33,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:33,066 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:33,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:33,066 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:33,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:33,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:33,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:28:33,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:33,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:33,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:36,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:36,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-18 17:28:36,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:36,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:28:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:28:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:28:36,904 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-18 17:28:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:36,979 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-18 17:28:36,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:28:36,979 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-18 17:28:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:36,980 INFO L225 Difference]: With dead ends: 63 [2019-01-18 17:28:36,980 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:28:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:28:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:28:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:28:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:28:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-18 17:28:36,983 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-18 17:28:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:36,984 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-18 17:28:36,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:28:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-18 17:28:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:28:36,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:36,985 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-18 17:28:36,985 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-18 17:28:36,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:36,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:36,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:38,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:38,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:38,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:38,500 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:38,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:38,500 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:28:38,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:38,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:38,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:38,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:38,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:38,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:42,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-18 17:28:42,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:42,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:28:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:28:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:28:42,185 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-18 17:28:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:42,289 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-18 17:28:42,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:28:42,289 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-18 17:28:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:42,290 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:28:42,290 INFO L226 Difference]: Without dead ends: 62 [2019-01-18 17:28:42,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:28:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-18 17:28:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-18 17:28:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:28:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:28:42,293 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-18 17:28:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:42,293 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:28:42,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:28:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:28:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:28:42,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:42,294 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-18 17:28:42,294 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-18 17:28:42,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:42,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:42,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:42,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:42,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:43,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:43,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:43,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:43,632 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:43,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:43,632 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:28:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:43,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:43,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:43,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:47,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:47,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-18 17:28:47,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:47,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:28:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:28:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:28:47,575 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-18 17:28:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:47,665 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-18 17:28:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:28:47,665 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-18 17:28:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:47,666 INFO L225 Difference]: With dead ends: 65 [2019-01-18 17:28:47,666 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:28:47,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:28:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:28:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:28:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:28:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-18 17:28:47,670 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-18 17:28:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:47,670 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-18 17:28:47,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:28:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-18 17:28:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:28:47,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:47,671 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-18 17:28:47,671 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-18 17:28:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:47,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:49,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:49,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:49,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:49,012 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:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:49,012 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:28:49,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:49,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:49,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-18 17:28:49,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:49,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:49,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:53,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:53,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-18 17:28:53,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:53,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:28:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:28:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:28:53,317 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-18 17:28:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:53,395 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:28:53,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:28:53,395 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-18 17:28:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:53,396 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:28:53,396 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:28:53,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:28:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:28:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-18 17:28:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:28:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-18 17:28:53,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-18 17:28:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:53,399 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-18 17:28:53,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:28:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-18 17:28:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:28:53,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:53,399 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-18 17:28:53,400 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-18 17:28:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:53,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:53,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:53,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:53,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:54,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:54,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:54,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:54,781 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:54,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:54,781 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:28:54,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:54,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:54,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:54,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:54,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:54,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:58,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:58,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-18 17:28:58,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:58,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:28:58,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:28:58,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:28:58,828 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-18 17:28:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:58,932 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-18 17:28:58,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:28:58,932 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-18 17:28:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:58,933 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:28:58,933 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:28:58,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:28:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:28:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:28:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:28:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-18 17:28:58,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-18 17:28:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-18 17:28:58,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:28:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-18 17:28:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:28:58,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:58,936 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-18 17:28:58,936 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-18 17:28:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:00,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:00,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:00,560 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,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,560 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:00,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:00,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:00,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:00,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:04,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:04,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-18 17:29:04,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:04,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:29:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:29:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:04,891 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-18 17:29:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:05,007 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-18 17:29:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:29:05,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-18 17:29:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:05,009 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:29:05,009 INFO L226 Difference]: Without dead ends: 66 [2019-01-18 17:29:05,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-18 17:29:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-18 17:29:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:29:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:29:05,011 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-18 17:29:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:05,011 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:29:05,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:29:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:29:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:29:05,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:05,012 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-18 17:29:05,012 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-18 17:29:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:05,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:05,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:06,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:06,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:06,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:06,682 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:06,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:06,682 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:06,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:06,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:07,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 17:29:07,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:07,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:07,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-18 17:29:11,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:11,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:29:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:29:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:29:11,110 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-18 17:29:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:11,227 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-18 17:29:11,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:29:11,228 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-18 17:29:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:11,228 INFO L225 Difference]: With dead ends: 69 [2019-01-18 17:29:11,228 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:29:11,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:29:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:29:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:29:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:29:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-18 17:29:11,232 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-18 17:29:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-18 17:29:11,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:29:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-18 17:29:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:29:11,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:11,233 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-18 17:29:11,234 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-18 17:29:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:11,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:11,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:13,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:13,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:13,441 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:13,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:13,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:13,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:13,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:13,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:13,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:13,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:17,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:17,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-18 17:29:17,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:17,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:29:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:29:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:29:17,992 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-18 17:29:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:18,107 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:29:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:29:18,112 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-18 17:29:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:18,113 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:29:18,113 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:29:18,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:29:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:29:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-18 17:29:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:29:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-18 17:29:18,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-18 17:29:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-18 17:29:18,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:29:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-18 17:29:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:29:18,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:18,118 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-18 17:29:18,118 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-18 17:29:18,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:18,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:18,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:19,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:19,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:19,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:19,661 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:19,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:19,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 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:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:19,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:19,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:19,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:25,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-18 17:29:25,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:25,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:29:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:29:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:29:25,782 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-18 17:29:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:25,869 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-18 17:29:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:29:25,870 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-18 17:29:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:25,870 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:29:25,870 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:29:25,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:29:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:29:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:29:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:29:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-18 17:29:25,873 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-18 17:29:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:25,873 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-18 17:29:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:29:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-18 17:29:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:29:25,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:25,874 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-18 17:29:25,875 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-18 17:29:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:25,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:28,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:28,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:28,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:28,204 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:28,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:28,204 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:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:28,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:28,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 17:29:28,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:28,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:28,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:33,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:33,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-18 17:29:33,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:33,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:29:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:29:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:29:33,281 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-18 17:29:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:33,389 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-18 17:29:33,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:29:33,390 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-18 17:29:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:33,390 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:29:33,390 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:29:33,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:29:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:29:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-18 17:29:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:29:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-18 17:29:33,393 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-18 17:29:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-18 17:29:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:29:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-18 17:29:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:29:33,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:33,394 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-18 17:29:33,395 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-18 17:29:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:33,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:33,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:35,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:35,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:35,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:35,011 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:35,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:35,011 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:29:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:35,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:35,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:35,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:35,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:35,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:39,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:39,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-18 17:29:39,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:39,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:29:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:29:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:29:39,907 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-18 17:29:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:40,193 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-18 17:29:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:29:40,194 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-18 17:29:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:40,194 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:29:40,194 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:29:40,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:29:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:29:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:29:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:29:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-18 17:29:40,197 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-18 17:29:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:40,197 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-18 17:29:40,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:29:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-18 17:29:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:29:40,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:40,198 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-18 17:29:40,198 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-18 17:29:40,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:40,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:40,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:41,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:41,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:41,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:41,952 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:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:41,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:41,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:42,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:42,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:46,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:46,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-18 17:29:46,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:46,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:29:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:29:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:29:46,910 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-18 17:29:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:46,999 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-18 17:29:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:29:47,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-18 17:29:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:47,001 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:29:47,001 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:29:47,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:29:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:29:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-18 17:29:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:29:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:29:47,004 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-18 17:29:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:47,004 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:29:47,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:29:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:29:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:29:47,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:47,005 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-18 17:29:47,005 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-18 17:29:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:47,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:48,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:48,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:48,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:48,910 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:48,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:48,910 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:29:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:48,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:49,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-18 17:29:49,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:49,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:49,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:54,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-18 17:29:54,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:54,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:29:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:29:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:29:54,443 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-18 17:29:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:54,628 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-18 17:29:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:29:54,628 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-18 17:29:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:54,629 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:29:54,629 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:29:54,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 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:29:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:29:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:29:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:29:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-18 17:29:54,632 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-18 17:29:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:54,632 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-18 17:29:54,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:29:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-18 17:29:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:29:54,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:54,633 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-18 17:29:54,634 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-18 17:29:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:54,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:54,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:56,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:56,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:56,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:56,391 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:56,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:56,392 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:29:56,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:56,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:56,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:56,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:56,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:56,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:01,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:01,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-18 17:30:01,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:01,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:30:01,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:30:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:01,567 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-18 17:30:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:01,713 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:30:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:30:01,714 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-18 17:30:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:01,714 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:30:01,715 INFO L226 Difference]: Without dead ends: 74 [2019-01-18 17:30:01,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-18 17:30:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-18 17:30:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:30:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-18 17:30:01,718 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-18 17:30:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:01,718 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-18 17:30:01,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:30:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-18 17:30:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-18 17:30:01,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:01,719 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-18 17:30:01,719 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-18 17:30:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:01,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:01,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:01,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:01,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:03,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:03,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:03,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:03,706 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:03,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:03,706 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:03,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:03,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:03,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:03,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:09,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-18 17:30:09,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:09,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:30:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:30:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:30:09,109 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-18 17:30:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:09,264 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-18 17:30:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:30:09,265 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-18 17:30:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:09,265 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:30:09,266 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:30:09,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:30:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:30:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:30:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:30:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-18 17:30:09,270 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-18 17:30:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:09,270 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-18 17:30:09,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:30:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-18 17:30:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:30:09,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:09,271 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-18 17:30:09,271 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-18 17:30:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:11,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:11,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:11,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:11,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:30:11,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:11,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 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:11,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:11,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:11,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-18 17:30:11,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:11,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:11,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:17,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:17,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-18 17:30:17,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:17,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:30:17,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:30:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:30:17,338 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-18 17:30:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:17,472 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-18 17:30:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:30:17,473 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-18 17:30:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:17,473 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:30:17,474 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 17:30:17,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:30:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 17:30:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-18 17:30:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:30:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:30:17,477 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-18 17:30:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:17,477 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:30:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:30:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:30:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:30:17,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:17,478 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-18 17:30:17,479 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-18 17:30:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:17,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:17,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:19,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:19,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:19,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:19,722 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:19,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:19,722 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:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:19,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:19,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:19,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:19,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:19,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:25,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:25,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-18 17:30:25,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:25,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:30:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:30:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:30:25,534 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-18 17:30:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:25,681 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-18 17:30:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:30:25,682 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-18 17:30:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:25,682 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:30:25,682 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:30:25,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:30:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:30:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:30:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:30:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-18 17:30:25,686 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-18 17:30:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:25,686 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-18 17:30:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:30:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-18 17:30:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:30:25,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:25,687 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-18 17:30:25,687 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-18 17:30:25,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:25,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:25,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:27,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:27,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:27,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:27,677 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:27,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:27,677 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:30:27,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:27,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:27,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:27,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:33,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:33,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-18 17:30:33,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:33,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:30:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:30:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:30:33,591 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-18 17:30:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:33,739 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:30:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:30:33,740 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-18 17:30:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:33,740 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:30:33,740 INFO L226 Difference]: Without dead ends: 78 [2019-01-18 17:30:33,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:30:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-18 17:30:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-18 17:30:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:30:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-18 17:30:33,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-18 17:30:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:33,743 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-18 17:30:33,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:30:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-18 17:30:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-18 17:30:33,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:33,744 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-18 17:30:33,744 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-18 17:30:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:33,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:33,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:35,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:35,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:35,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:35,862 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:35,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:35,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:35,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:35,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:36,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 17:30:36,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:36,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:36,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:42,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-18 17:30:42,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:42,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:30:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:30:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:30:42,592 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-18 17:30:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:42,703 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-18 17:30:42,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:30:42,704 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-18 17:30:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:42,704 INFO L225 Difference]: With dead ends: 81 [2019-01-18 17:30:42,705 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:30:42,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:30:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:30:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:30:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:30:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-18 17:30:42,709 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-18 17:30:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:42,709 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-18 17:30:42,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:30:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-18 17:30:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:30:42,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:42,710 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-18 17:30:42,710 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-18 17:30:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:42,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:42,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:45,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:45,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:45,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:45,044 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:45,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:45,044 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:30:45,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:45,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:45,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:45,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:45,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:45,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-18 17:30:51,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:51,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:30:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:30:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:30:51,193 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-18 17:30:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:51,319 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-18 17:30:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:30:51,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-18 17:30:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:51,320 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:30:51,321 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:30:51,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 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:30:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:30:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-18 17:30:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:30:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-18 17:30:51,323 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-18 17:30:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:51,323 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-18 17:30:51,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:30:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-18 17:30:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:30:51,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:51,324 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-18 17:30:51,325 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-18 17:30:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:53,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:53,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:53,418 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:53,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,418 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:30:53,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:53,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:53,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:00,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-18 17:31:00,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:00,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:31:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:31:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:31:00,074 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-18 17:31:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:00,467 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-18 17:31:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:31:00,467 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-18 17:31:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:00,468 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:31:00,468 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:31:00,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:31:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:31:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:31:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:31:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-18 17:31:00,470 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-18 17:31:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:00,471 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-18 17:31:00,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:31:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-18 17:31:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:31:00,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:00,471 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-18 17:31:00,471 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-18 17:31:00,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:00,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:02,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:02,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:02,951 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:02,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,951 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:02,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:02,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:03,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 17:31:03,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:03,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:03,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-18 17:31:10,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:31:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:31:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:10,432 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-18 17:31:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:11,062 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-18 17:31:11,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:31:11,063 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-18 17:31:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:11,064 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:31:11,064 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:31:11,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:31:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-18 17:31:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:31:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:31:11,067 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-18 17:31:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:11,068 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:31:11,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:31:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:31:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:31:11,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:11,068 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-18 17:31:11,069 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-18 17:31:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:13,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:13,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:13,290 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,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,290 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:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:13,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:13,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:13,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:13,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:13,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:20,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-18 17:31:20,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:20,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:31:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:31:20,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:31:20,438 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-18 17:31:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:20,574 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-18 17:31:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:31:20,575 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-18 17:31:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:20,575 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:31:20,575 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:31:20,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:31:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:31:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:31:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:31:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-18 17:31:20,580 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-18 17:31:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:20,580 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-18 17:31:20,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:31:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-18 17:31:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:31:20,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:20,581 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-18 17:31:20,581 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-18 17:31:20,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:20,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:20,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:23,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:23,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:23,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:23,075 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:23,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:23,075 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:31:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:23,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:23,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:23,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:30,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:30,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-18 17:31:30,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:30,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:31:30,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:31:30,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:31:30,051 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-18 17:31:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:30,193 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:31:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:31:30,194 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-18 17:31:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:30,194 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:31:30,194 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:31:30,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:31:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:31:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-18 17:31:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:31:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-18 17:31:30,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-18 17:31:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:30,197 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-18 17:31:30,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:31:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-18 17:31:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:31:30,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:30,198 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-18 17:31:30,198 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-18 17:31:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:30,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:30,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:32,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:32,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:32,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:32,642 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:32,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:32,642 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:31:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:32,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:33,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-18 17:31:33,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:33,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:33,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:40,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:40,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-18 17:31:40,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:40,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:31:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:31:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:31:40,436 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-18 17:31:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:40,711 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-18 17:31:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:31:40,712 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-18 17:31:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:40,712 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:31:40,712 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:31:40,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:31:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:31:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:31:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:31:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-18 17:31:40,715 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-18 17:31:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:40,715 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-18 17:31:40,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:31:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-18 17:31:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:31:40,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:40,715 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-18 17:31:40,716 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:40,716 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-18 17:31:40,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:43,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:43,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:43,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:43,235 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,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:43,235 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:31:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:43,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:43,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:43,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:43,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:43,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:51,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:51,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-18 17:31:51,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:31:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:31:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:31:51,250 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-18 17:31:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:51,422 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-18 17:31:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:31:51,422 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-18 17:31:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:51,423 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:31:51,423 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:31:51,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:31:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:31:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-18 17:31:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:31:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:31:51,427 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-18 17:31:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:51,427 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:31:51,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:31:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:31:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:31:51,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:51,428 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-18 17:31:51,428 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-18 17:31:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:51,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:51,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:53,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:53,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:53,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:53,996 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:53,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:53,996 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:31:54,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:54,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:54,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:54,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:01,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-18 17:32:01,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:01,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:32:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:32:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:32:01,480 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-18 17:32:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:01,709 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-18 17:32:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:32:01,709 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-18 17:32:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:01,709 INFO L225 Difference]: With dead ends: 89 [2019-01-18 17:32:01,710 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:32:01,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 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:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:32:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:32:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:32:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-18 17:32:01,713 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-18 17:32:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:01,713 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-18 17:32:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:32:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-18 17:32:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:32:01,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:01,714 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-18 17:32:01,714 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-18 17:32:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:01,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:01,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:04,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:04,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:04,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:04,238 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:04,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:04,238 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:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:04,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:05,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-18 17:32:05,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:05,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:05,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:12,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-18 17:32:12,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:12,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:32:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:32:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:32:12,915 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-18 17:32:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:13,052 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:32:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:32:13,053 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-18 17:32:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:13,054 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:32:13,054 INFO L226 Difference]: Without dead ends: 88 [2019-01-18 17:32:13,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:32:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-18 17:32:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-18 17:32:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:32:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-18 17:32:13,056 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-18 17:32:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:13,056 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-18 17:32:13,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:32:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-18 17:32:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:32:13,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:13,057 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-18 17:32:13,057 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-18 17:32:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:13,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:13,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:15,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:15,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:15,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:15,528 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:15,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:15,528 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:32:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:15,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:15,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:15,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:15,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:15,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:23,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-18 17:32:23,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:23,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:32:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:32:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:32:23,511 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-18 17:32:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:23,662 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-18 17:32:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:32:23,662 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-18 17:32:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:23,663 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:32:23,663 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:32:23,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:32:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:32:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:32:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:32:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-18 17:32:23,667 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-18 17:32:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:23,667 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-18 17:32:23,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:32:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-18 17:32:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:32:23,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:23,668 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-18 17:32:23,668 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-18 17:32:23,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:26,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:26,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:26,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:26,281 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:26,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:26,281 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:32:26,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:26,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:26,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:26,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:35,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:35,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-18 17:32:35,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:35,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:32:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:32:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:32:35,391 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-18 17:32:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:35,743 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-18 17:32:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:32:35,743 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-18 17:32:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:35,744 INFO L225 Difference]: With dead ends: 92 [2019-01-18 17:32:35,744 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 17:32:35,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:32:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 17:32:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-18 17:32:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 17:32:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-18 17:32:35,747 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-18 17:32:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:35,748 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-18 17:32:35,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:32:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-18 17:32:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-18 17:32:35,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:35,749 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-18 17:32:35,749 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-18 17:32:35,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:35,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:35,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:35,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:35,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:38,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:38,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:38,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:38,753 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:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:38,753 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:32:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:38,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:39,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-18 17:32:39,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:39,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:39,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-18 17:32:48,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:48,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:32:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:32:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:32:48,074 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-18 17:32:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:48,292 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-18 17:32:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:32:48,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-18 17:32:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:48,293 INFO L225 Difference]: With dead ends: 93 [2019-01-18 17:32:48,293 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:32:48,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:32:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:32:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:32:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:32:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-18 17:32:48,295 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-18 17:32:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:48,296 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-18 17:32:48,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:32:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-18 17:32:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:32:48,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:48,296 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-18 17:32:48,296 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-18 17:32:48,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:48,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:48,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:50,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:50,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:50,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:50,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:32:50,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:50,983 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:32:50,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:50,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:51,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:51,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:51,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:51,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-18 17:32:59,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:59,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 17:32:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 17:32:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:32:59,489 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-18 17:32:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:59,622 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-18 17:32:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-18 17:32:59,623 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-18 17:32:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:59,623 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:32:59,624 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:32:59,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:32:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:32:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-18 17:32:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:32:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:32:59,627 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-18 17:32:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:59,627 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:32:59,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 17:32:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:32:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:32:59,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:59,627 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-18 17:32:59,628 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-18 17:32:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:59,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:59,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:02,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:02,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:02,565 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:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:02,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 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:33:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:02,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:02,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:02,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:10,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-18 17:33:10,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:10,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:33:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:33:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:33:10,967 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-18 17:33:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:11,174 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-18 17:33:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:33:11,175 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-18 17:33:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:11,175 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:33:11,175 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:33:11,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:33:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:33:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:33:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:33:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-18 17:33:11,178 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-18 17:33:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:11,178 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-18 17:33:11,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:33:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-18 17:33:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:33:11,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:11,179 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-18 17:33:11,179 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-18 17:33:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:11,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:11,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:14,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:14,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:14,232 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,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:14,233 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:33:14,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:14,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:15,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-18 17:33:15,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:15,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:15,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:24,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:24,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-18 17:33:24,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:24,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:33:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:33:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:33:24,123 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-18 17:33:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:24,257 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:33:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 17:33:24,257 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-18 17:33:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:24,258 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:33:24,258 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:33:24,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:33:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:33:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-18 17:33:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:33:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-18 17:33:24,262 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-18 17:33:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:24,262 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-18 17:33:24,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:33:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-18 17:33:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:33:24,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:24,263 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-18 17:33:24,263 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-18 17:33:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:24,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:24,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:24,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:24,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:27,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:27,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:27,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:27,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:33:27,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:27,142 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:33:27,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:27,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:33:27,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:27,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:27,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:27,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:35,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:35,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-18 17:33:35,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:35,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 17:33:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 17:33:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:33:35,908 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-18 17:33:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:36,142 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-18 17:33:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 17:33:36,143 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-18 17:33:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:36,143 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:33:36,143 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:33:36,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:33:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:33:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 17:33:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 17:33:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-18 17:33:36,147 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-18 17:33:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:36,147 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-18 17:33:36,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 17:33:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-18 17:33:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 17:33:36,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:36,148 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-18 17:33:36,149 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-18 17:33:36,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:36,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:36,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:39,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:39,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:39,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:39,338 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,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:39,338 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:33:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:39,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:39,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:48,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:48,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-18 17:33:48,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:48,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 17:33:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 17:33:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 17:33:48,285 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-18 17:33:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:48,527 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-18 17:33:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-18 17:33:48,527 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-18 17:33:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:48,528 INFO L225 Difference]: With dead ends: 98 [2019-01-18 17:33:48,528 INFO L226 Difference]: Without dead ends: 96 [2019-01-18 17:33:48,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 17:33:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-18 17:33:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-18 17:33:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:33:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 17:33:48,531 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-18 17:33:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:48,531 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 17:33:48,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 17:33:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 17:33:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 17:33:48,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:48,532 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-18 17:33:48,532 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-18 17:33:48,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:48,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:48,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:51,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:51,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:51,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:51,658 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:51,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:51,658 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:33:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:51,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:52,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-18 17:33:52,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:52,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:52,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:02,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-18 17:34:02,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:02,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:34:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:34:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 17:34:02,309 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-18 17:34:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:02,462 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-18 17:34:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 17:34:02,462 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-18 17:34:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:02,463 INFO L225 Difference]: With dead ends: 99 [2019-01-18 17:34:02,463 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:34:02,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 17:34:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:34:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 17:34:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 17:34:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-18 17:34:02,466 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-18 17:34:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:02,466 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-18 17:34:02,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 17:34:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-18 17:34:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 17:34:02,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:02,467 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-18 17:34:02,467 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-18 17:34:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:02,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:02,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:05,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:05,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:05,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:05,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:34:05,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:05,866 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:34:05,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:05,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:05,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:05,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:05,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:05,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:15,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:15,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-18 17:34:15,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:15,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 17:34:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 17:34:15,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:34:15,285 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-18 17:34:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:15,456 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 17:34:15,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-18 17:34:15,457 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-18 17:34:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:15,457 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:34:15,457 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 17:34:15,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:34:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 17:34:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-18 17:34:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:34:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-18 17:34:15,462 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-18 17:34:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:15,462 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-18 17:34:15,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 17:34:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-18 17:34:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 17:34:15,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:15,462 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-18 17:34:15,463 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-18 17:34:15,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:15,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:15,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:18,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:18,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:18,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:18,587 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:18,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:18,587 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:34:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:18,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:18,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:18,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:28,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-18 17:34:28,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:28,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 17:34:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 17:34:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 17:34:28,363 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-18 17:34:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:28,520 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-18 17:34:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 17:34:28,521 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-18 17:34:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:28,521 INFO L225 Difference]: With dead ends: 101 [2019-01-18 17:34:28,521 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:34:28,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 17:34:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:34:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 17:34:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 17:34:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-18 17:34:28,524 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-18 17:34:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:28,524 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-18 17:34:28,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 17:34:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-18 17:34:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 17:34:28,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:28,525 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-18 17:34:28,525 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-18 17:34:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:32,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:32,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:32,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:32,063 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:32,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:32,063 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:34:32,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:32,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:33,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-18 17:34:33,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:33,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:33,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:43,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:43,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-18 17:34:43,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:43,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 17:34:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 17:34:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 17:34:43,486 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-18 17:34:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:43,648 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-18 17:34:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 17:34:43,648 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-18 17:34:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:43,649 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:34:43,649 INFO L226 Difference]: Without dead ends: 100 [2019-01-18 17:34:43,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 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:34:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-18 17:34:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-18 17:34:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:34:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-18 17:34:43,652 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-18 17:34:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:43,653 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-18 17:34:43,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 17:34:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-18 17:34:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 17:34:43,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:43,654 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-18 17:34:43,654 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-18 17:34:43,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:43,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:43,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:47,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:47,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:47,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:47,121 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:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:47,121 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:34:47,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:47,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:47,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:47,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:47,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:47,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:57,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-18 17:34:57,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 17:34:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 17:34:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:34:57,442 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-18 17:34:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:57,651 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-18 17:34:57,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 17:34:57,652 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-18 17:34:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:57,652 INFO L225 Difference]: With dead ends: 103 [2019-01-18 17:34:57,652 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:34:57,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 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:34:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:34:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 17:34:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:34:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-18 17:34:57,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-18 17:34:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:57,657 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-18 17:34:57,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 17:34:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-18 17:34:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:34:57,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:57,658 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-18 17:34:57,658 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-18 17:34:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:01,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:01,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:01,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:01,274 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:01,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:01,274 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:35:01,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:01,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:01,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:01,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:11,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-18 17:35:11,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:11,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 17:35:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 17:35:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:35:11,722 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-18 17:35:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:12,011 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-18 17:35:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-18 17:35:12,012 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-18 17:35:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:12,012 INFO L225 Difference]: With dead ends: 104 [2019-01-18 17:35:12,012 INFO L226 Difference]: Without dead ends: 102 [2019-01-18 17:35:12,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:35:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-18 17:35:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-18 17:35:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 17:35:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 17:35:12,016 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-18 17:35:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:12,016 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 17:35:12,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 17:35:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 17:35:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 17:35:12,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:12,017 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-18 17:35:12,017 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-18 17:35:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:12,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:15,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:15,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:15,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:15,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:35:15,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:15,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 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:35:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:15,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:17,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-18 17:35:17,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:17,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:17,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:27,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:27,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-18 17:35:27,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:27,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 17:35:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 17:35:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 17:35:27,978 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-18 17:35:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:28,212 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-18 17:35:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 17:35:28,212 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-18 17:35:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:28,213 INFO L225 Difference]: With dead ends: 105 [2019-01-18 17:35:28,213 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:35:28,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 17:35:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:35:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 17:35:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 17:35:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-18 17:35:28,216 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-18 17:35:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:28,217 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-18 17:35:28,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 17:35:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-18 17:35:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 17:35:28,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:28,217 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-18 17:35:28,217 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-18 17:35:28,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:28,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:28,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:28,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:28,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:31,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:31,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:31,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:31,984 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:31,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:31,984 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:35:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:31,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:32,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:32,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:32,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:32,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:42,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:42,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-18 17:35:42,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:42,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 17:35:42,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 17:35:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:35:42,713 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-18 17:35:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:42,980 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 17:35:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-18 17:35:42,980 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-18 17:35:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:42,981 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:35:42,981 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 17:35:42,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:35:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 17:35:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-18 17:35:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 17:35:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-18 17:35:42,984 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-18 17:35:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:42,984 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-18 17:35:42,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 17:35:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-18 17:35:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 17:35:42,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:42,985 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-18 17:35:42,985 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:42,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-18 17:35:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:42,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:42,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:46,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:46,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:46,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:46,784 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:46,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:46,784 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:35:46,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:46,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:46,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:46,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:57,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:57,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-18 17:35:57,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:57,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 17:35:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 17:35:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 17:35:57,826 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-18 17:35:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:58,016 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-18 17:35:58,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 17:35:58,016 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-18 17:35:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:58,017 INFO L225 Difference]: With dead ends: 107 [2019-01-18 17:35:58,018 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:35:58,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 17:35:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:35:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 17:35:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 17:35:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-18 17:35:58,023 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-18 17:35:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:58,023 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-18 17:35:58,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 17:35:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-18 17:35:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 17:35:58,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:58,024 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-18 17:35:58,024 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-18 17:35:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:01,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:01,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:01,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:01,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:36:01,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:01,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 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:36:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:01,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:03,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-18 17:36:03,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:03,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:03,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:14,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:14,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-18 17:36:14,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:14,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 17:36:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 17:36:14,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:36:14,976 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-18 17:36:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:15,318 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-18 17:36:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 17:36:15,318 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-18 17:36:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:15,319 INFO L225 Difference]: With dead ends: 108 [2019-01-18 17:36:15,319 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 17:36:15,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:36:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 17:36:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-18 17:36:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 17:36:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 17:36:15,324 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-18 17:36:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:15,324 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 17:36:15,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 17:36:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 17:36:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 17:36:15,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:15,325 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-18 17:36:15,325 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-18 17:36:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:19,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:19,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:19,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:19,372 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:19,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:19,372 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:36:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:19,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:19,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:19,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:19,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:19,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:30,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-18 17:36:30,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 17:36:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 17:36:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:36:30,878 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-18 17:36:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:31,178 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-18 17:36:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 17:36:31,179 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-18 17:36:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:31,179 INFO L225 Difference]: With dead ends: 109 [2019-01-18 17:36:31,179 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:36:31,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:36:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:36:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 17:36:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 17:36:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-18 17:36:31,183 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-18 17:36:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:31,184 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-18 17:36:31,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 17:36:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-18 17:36:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 17:36:31,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:31,185 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-18 17:36:31,185 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-18 17:36:31,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:35,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:35,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:35,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:35,354 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:35,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:35,354 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:36:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:35,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:35,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:35,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-18 17:36:46,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 17:36:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 17:36:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 17:36:46,698 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-18 17:36:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:46,933 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 17:36:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-18 17:36:46,941 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-18 17:36:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:46,941 INFO L225 Difference]: With dead ends: 110 [2019-01-18 17:36:46,941 INFO L226 Difference]: Without dead ends: 108 [2019-01-18 17:36:46,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 17:36:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-18 17:36:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-18 17:36:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:36:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-18 17:36:46,945 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-18 17:36:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:46,945 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-18 17:36:46,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 17:36:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-18 17:36:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 17:36:46,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:46,946 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-18 17:36:46,946 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-18 17:36:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:46,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:46,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:51,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:51,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:51,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:51,015 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:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:51,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 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:36:51,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:51,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:53,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-18 17:36:53,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:53,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:53,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-18 17:37:04,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:04,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 17:37:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 17:37:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 17:37:04,746 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-18 17:37:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:04,980 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-18 17:37:04,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 17:37:04,980 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-18 17:37:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:04,981 INFO L225 Difference]: With dead ends: 111 [2019-01-18 17:37:04,981 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:37:04,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 17:37:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:37:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 17:37:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 17:37:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-18 17:37:04,985 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-18 17:37:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:04,985 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-18 17:37:04,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 17:37:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-18 17:37:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 17:37:04,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:04,986 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-18 17:37:04,986 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-18 17:37:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:04,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:04,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:09,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:09,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:09,164 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:09,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:09,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:09,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:09,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:09,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:09,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:09,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:21,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:21,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-18 17:37:21,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:21,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-18 17:37:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-18 17:37:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 17:37:21,190 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-18 17:37:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:21,456 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-18 17:37:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-18 17:37:21,456 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-18 17:37:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:21,457 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:37:21,457 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 17:37:21,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 17:37:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 17:37:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-18 17:37:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-18 17:37:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-18 17:37:21,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-18 17:37:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:21,461 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-18 17:37:21,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-18 17:37:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-18 17:37:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-18 17:37:21,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:21,462 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-18 17:37:21,462 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-18 17:37:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:21,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:21,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:25,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:25,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:25,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:25,669 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:25,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:25,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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:25,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:25,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:25,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-18 17:37:37,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-18 17:37:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-18 17:37:37,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 17:37:37,814 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-18 17:37:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:38,082 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-18 17:37:38,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-18 17:37:38,082 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-18 17:37:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:38,083 INFO L225 Difference]: With dead ends: 113 [2019-01-18 17:37:38,083 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:37:38,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 17:37:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:37:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 17:37:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:37:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-18 17:37:38,086 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-18 17:37:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:38,087 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-18 17:37:38,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-18 17:37:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-18 17:37:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 17:37:38,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:38,087 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-18 17:37:38,087 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-18 17:37:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:38,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:38,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:42,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:42,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:42,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:42,425 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:42,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:42,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:42,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:42,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:44,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-18 17:37:44,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:44,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:44,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:57,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:57,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-18 17:37:57,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:57,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-18 17:37:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-18 17:37:57,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 17:37:57,168 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-18 17:37:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:57,492 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-18 17:37:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-18 17:37:57,492 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-18 17:37:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:57,492 INFO L225 Difference]: With dead ends: 114 [2019-01-18 17:37:57,492 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 17:37:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 17:37:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 17:37:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-18 17:37:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 17:37:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 17:37:57,496 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-18 17:37:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:57,496 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 17:37:57,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-18 17:37:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 17:37:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 17:37:57,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:57,497 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-18 17:37:57,497 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-18 17:37:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:57,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:57,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:01,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:01,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:01,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:01,931 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:01,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:01,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:01,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:01,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:02,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:02,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:02,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:02,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:14,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-18 17:38:14,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:14,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 17:38:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 17:38:14,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 17:38:14,382 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-18 17:38:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:14,654 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-18 17:38:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-18 17:38:14,655 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-18 17:38:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:14,655 INFO L225 Difference]: With dead ends: 115 [2019-01-18 17:38:14,655 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:38:14,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 17:38:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:38:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 17:38:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:38:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-18 17:38:14,660 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-18 17:38:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:14,660 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-18 17:38:14,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 17:38:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-18 17:38:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 17:38:14,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:14,661 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-18 17:38:14,661 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-18 17:38:14,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:14,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:14,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:14,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:18,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:18,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:18,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:18,988 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:18,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:18,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:18,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:19,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:19,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:32,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:32,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-18 17:38:32,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:32,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 17:38:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 17:38:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 17:38:32,221 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-18 17:38:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:32,441 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 17:38:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-18 17:38:32,441 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-18 17:38:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:32,441 INFO L225 Difference]: With dead ends: 116 [2019-01-18 17:38:32,442 INFO L226 Difference]: Without dead ends: 114 [2019-01-18 17:38:32,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 17:38:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-18 17:38:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-18 17:38:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 17:38:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-18 17:38:32,446 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-18 17:38:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:32,447 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-18 17:38:32,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 17:38:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-18 17:38:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-18 17:38:32,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:32,448 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-18 17:38:32,448 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-18 17:38:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:32,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:32,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:36,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:36,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:36,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:36,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:38:36,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:36,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:36,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:36,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:39,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-18 17:38:39,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:39,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:39,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-18 17:38:52,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:52,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 17:38:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 17:38:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 17:38:52,791 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-18 17:38:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:53,169 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-18 17:38:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-18 17:38:53,169 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-18 17:38:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:53,170 INFO L225 Difference]: With dead ends: 117 [2019-01-18 17:38:53,170 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:38:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 17:38:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:38:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-18 17:38:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 17:38:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-18 17:38:53,174 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-18 17:38:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:53,174 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-18 17:38:53,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 17:38:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-18 17:38:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 17:38:53,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:53,175 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-18 17:38:53,175 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-18 17:38:53,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:53,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:53,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:57,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:57,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:57,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:57,632 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:57,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:57,632 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:57,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:57,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:57,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:57,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:57,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:11,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2019-01-18 17:39:11,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:11,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-18 17:39:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-18 17:39:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-01-18 17:39:11,415 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-01-18 17:39:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:11,722 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-18 17:39:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-01-18 17:39:11,722 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-01-18 17:39:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:11,723 INFO L225 Difference]: With dead ends: 118 [2019-01-18 17:39:11,723 INFO L226 Difference]: Without dead ends: 116 [2019-01-18 17:39:11,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-01-18 17:39:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-18 17:39:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-18 17:39:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-18 17:39:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-18 17:39:11,727 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-01-18 17:39:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:11,727 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-18 17:39:11,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-18 17:39:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-18 17:39:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-18 17:39:11,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:11,727 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-01-18 17:39:11,728 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-01-18 17:39:11,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat