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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:25:58,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:25:58,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:25:58,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:25:58,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:25:58,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:25:58,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:25:58,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:25:58,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:25:58,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:25:58,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:25:58,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:25:58,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:25:58,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:25:58,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:25:58,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:25:58,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:25:58,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:25:58,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:25:58,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:25:58,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:25:58,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:25:58,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:25:58,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:25:58,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:25:58,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:25:58,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:25:58,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:25:58,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:25:58,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:25:58,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:25:58,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:25:58,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:25:58,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:25:58,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:25:58,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:25:58,857 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-02-18 09:25:58,879 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:25:58,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:25:58,881 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:25:58,881 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:25:58,881 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:25:58,881 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:25:58,881 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:25:58,882 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:25:58,882 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:25:58,882 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:25:58,883 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:25:58,883 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:25:58,883 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:25:58,883 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:25:58,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:25:58,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:25:58,885 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:25:58,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:25:58,885 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:25:58,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:25:58,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:25:58,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:25:58,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:25:58,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:25:58,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:25:58,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:25:58,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:58,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:25:58,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:25:58,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:25:58,890 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:25:58,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:25:58,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:25:58,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:25:58,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:25:58,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:25:58,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:25:58,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:25:58,936 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:25:58,937 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:25:58,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-18 09:25:58,938 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-18 09:25:58,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:25:58,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:25:58,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:58,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:25:58,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:25:58,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:59,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:25:59,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:25:59,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:25:59,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/1) ... [2019-02-18 09:25:59,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:25:59,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:25:59,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:25:59,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:25:59,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:59,107 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-18 09:25:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:25:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:25:59,346 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:25:59,347 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-18 09:25:59,348 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:59 BoogieIcfgContainer [2019-02-18 09:25:59,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:25:59,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:25:59,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:25:59,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:25:59,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:58" (1/2) ... [2019-02-18 09:25:59,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af4a57 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:59, skipping insertion in model container [2019-02-18 09:25:59,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:59" (2/2) ... [2019-02-18 09:25:59,354 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-18 09:25:59,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:25:59,369 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:25:59,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:25:59,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:25:59,412 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:25:59,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:25:59,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:25:59,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:25:59,413 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:25:59,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:25:59,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:25:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-18 09:25:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:25:59,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:59,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:25:59,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-18 09:25:59,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:59,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:25:59,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:25:59,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:25:59,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:25:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:25:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:25:59,709 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-18 09:25:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:59,876 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-18 09:25:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:25:59,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:25:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:59,888 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:25:59,888 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:25:59,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:25:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:25:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-18 09:25:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:25:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-18 09:25:59,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-18 09:25:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:59,929 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-18 09:25:59,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:25:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-18 09:25:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:25:59,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:59,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:25:59,930 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-18 09:25:59,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:59,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:00,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:26:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-18 09:26:00,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:26:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:26:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:26:00,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:26:00,036 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-18 09:26:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:00,156 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-18 09:26:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:26:00,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-18 09:26:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:00,157 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:26:00,157 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:26:00,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:26:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:26:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-18 09:26:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:26:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-18 09:26:00,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-18 09:26:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:00,164 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-18 09:26:00,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:26:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-18 09:26:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:26:00,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:00,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:26:00,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-18 09:26:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:26:00,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:26:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:26:00,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:26:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:26:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:26:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:26:00,234 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-18 09:26:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:00,271 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-18 09:26:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:26:00,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-18 09:26:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:00,272 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:26:00,272 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:26:00,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-18 09:26:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:26:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-18 09:26:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:26:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-18 09:26:00,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-18 09:26:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:00,277 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-18 09:26:00,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:26:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-18 09:26:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:26:00,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:00,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:26:00,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-18 09:26:00,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:00,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:00,574 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-18 09:26:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:00,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:00,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:00,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:26:00,652 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-18 09:26:00,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:26:00,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:26:00,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:26:00,817 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:26:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:00,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:26:00,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:00,824 INFO 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-02-18 09:26:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:00,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:00,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:01,156 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-02-18 09:26:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-18 09:26:01,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:01,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:26:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:26:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:26:01,273 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-18 09:26:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:01,516 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-18 09:26:01,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:26:01,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-18 09:26:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:01,519 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:26:01,519 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:26:01,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:26:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:26:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-18 09:26:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:26:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-18 09:26:01,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-18 09:26:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:01,524 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-18 09:26:01,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:26:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-18 09:26:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:26:01,525 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:01,525 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:26:01,525 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-18 09:26:01,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:01,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:01,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:01,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:01,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-18 09:26:01,616 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-18 09:26:01,618 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:26:01,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:26:01,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:26:01,680 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-02-18 09:26:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:01,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:26:01,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:01,681 INFO 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-02-18 09:26:01,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:01,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:01,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:01,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-18 09:26:01,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:01,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:26:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:26:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:26:01,846 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-18 09:26:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:02,218 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-18 09:26:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:26:02,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-18 09:26:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:02,218 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:26:02,219 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:26:02,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:26:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:26:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-18 09:26:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:26:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-18 09:26:02,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-18 09:26:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:02,224 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-18 09:26:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:26:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-18 09:26:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:26:02,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:02,225 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:26:02,225 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-18 09:26:02,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:02,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:02,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:02,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:02,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26: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 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-02-18 09:26:02,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:02,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:02,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:26:02,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:02,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-18 09:26:02,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:02,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:26:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:26:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:26:02,755 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-18 09:26:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:03,013 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-18 09:26:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:26:03,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-18 09:26:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:03,015 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:26:03,015 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:26:03,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:26:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:26:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-18 09:26:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:26:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-18 09:26:03,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-18 09:26:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:03,022 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-18 09:26:03,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:26:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-18 09:26:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:26:03,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:03,023 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-18 09:26:03,024 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-18 09:26:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:03,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:03,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:03,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,137 INFO 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-02-18 09:26:03,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:03,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:03,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:03,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:03,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:03,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-18 09:26:03,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:03,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:26:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:26:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:26:03,269 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-18 09:26:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:03,400 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-18 09:26:03,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:26:03,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-18 09:26:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:03,401 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:26:03,402 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:26:03,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:26:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:26:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-18 09:26:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:26:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-18 09:26:03,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-18 09:26:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:03,407 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-18 09:26:03,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:26:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-18 09:26:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:26:03,408 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:03,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-18 09:26:03,409 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-18 09:26:03,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:03,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:03,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:03,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:03,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:03,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:03,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-18 09:26:03,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:03,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:26:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:26:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:26:03,985 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-18 09:26:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:04,447 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-18 09:26:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:26:04,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-18 09:26:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:04,455 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:26:04,455 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:26:04,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:26:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:26:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-18 09:26:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:26:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-18 09:26:04,462 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-18 09:26:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:04,463 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-18 09:26:04,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:26:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-18 09:26:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:26:04,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:04,464 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-18 09:26:04,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-18 09:26:04,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:04,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:04,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:04,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,573 INFO 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-02-18 09:26:04,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:04,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:04,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:26:04,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:04,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:04,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-18 09:26:04,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:04,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:26:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:26:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:26:04,758 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-18 09:26:04,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:04,972 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-18 09:26:04,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:26:04,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-18 09:26:04,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:04,973 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:26:04,973 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:26:04,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:26:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:26:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-18 09:26:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:26:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-18 09:26:04,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-18 09:26:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:04,980 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-18 09:26:04,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:26:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-18 09:26:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:26:04,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:04,981 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-18 09:26:04,982 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-18 09:26:04,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:05,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:05,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:05,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,228 INFO 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-02-18 09:26:05,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:05,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:05,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:05,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:05,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:05,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-18 09:26:05,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:05,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:26:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:26:05,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:26:05,483 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-18 09:26:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:06,201 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-18 09:26:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:26:06,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-18 09:26:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:06,205 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:26:06,206 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:26:06,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:26:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:26:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-18 09:26:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:26:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-18 09:26:06,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-18 09:26:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:06,215 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-18 09:26:06,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:26:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-18 09:26:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:26:06,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:06,216 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-18 09:26:06,216 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-18 09:26:06,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:06,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:06,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:06,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:06,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:06,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:06,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:06,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:06,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-18 09:26:06,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:06,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:26:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:26:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:26:06,984 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-18 09:26:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:07,288 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-18 09:26:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:26:07,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-18 09:26:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:07,289 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:26:07,290 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:26:07,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:26:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:26:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-18 09:26:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:26:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-18 09:26:07,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-18 09:26:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:07,297 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-18 09:26:07,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:26:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-18 09:26:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:26:07,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:07,298 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-18 09:26:07,298 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-18 09:26:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:07,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:07,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:07,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:07,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:07,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:26:07,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:07,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-18 09:26:08,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:08,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:26:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:26:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:26:08,758 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-18 09:26:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:10,843 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-18 09:26:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:26:10,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-18 09:26:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:10,844 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:26:10,845 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:26:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:26:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-18 09:26:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:26:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-18 09:26:10,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-18 09:26:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-18 09:26:10,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:26:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-18 09:26:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:26:10,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:10,860 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-18 09:26:10,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-18 09:26:10,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:10,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:11,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:11,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:11,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:11,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:11,262 INFO 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-02-18 09:26:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:11,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:11,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:11,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:11,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:11,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-18 09:26:11,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:11,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:26:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:26:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:26:11,628 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-18 09:26:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:12,930 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-18 09:26:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:26:12,930 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-18 09:26:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:12,932 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:26:12,932 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:26:12,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:26:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:26:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-18 09:26:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:26:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-18 09:26:12,942 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-18 09:26:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:12,943 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-18 09:26:12,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:26:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-18 09:26:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:26:12,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:12,944 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-18 09:26:12,945 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-18 09:26:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:13,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:13,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:13,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,102 INFO 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-02-18 09:26:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:13,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:13,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:13,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-18 09:26:13,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:13,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:26:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:26:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:26:13,539 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-18 09:26:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:13,802 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-18 09:26:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:26:13,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-18 09:26:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:13,804 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:26:13,804 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:26:13,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:26:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:26:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-18 09:26:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:26:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-18 09:26:13,814 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-18 09:26:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:13,814 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-18 09:26:13,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:26:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-18 09:26:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:26:13,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:13,815 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-18 09:26:13,816 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-18 09:26:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:13,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:13,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:14,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:14,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:14,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,144 INFO 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-02-18 09:26:14,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:14,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:14,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:26:14,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:14,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:14,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-18 09:26:14,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:14,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:26:14,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:26:14,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:26:14,710 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-18 09:26:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:15,930 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-18 09:26:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:26:15,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-18 09:26:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:15,932 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:26:15,932 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:26:15,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:26:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-18 09:26:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:26:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-18 09:26:15,942 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-18 09:26:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-18 09:26:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:26:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-18 09:26:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:26:15,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:15,944 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-18 09:26:15,944 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-18 09:26:15,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:16,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:16,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:16,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,231 INFO 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-02-18 09:26:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:16,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:16,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:16,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:16,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:16,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-18 09:26:16,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:16,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:26:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:26:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:26:16,652 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-18 09:26:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:17,001 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-18 09:26:17,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:26:17,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-18 09:26:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:17,006 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:26:17,006 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:26:17,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:26:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:26:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-18 09:26:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:26:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-18 09:26:17,016 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-18 09:26:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:17,016 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-18 09:26:17,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:26:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-18 09:26:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:26:17,018 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:17,018 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-18 09:26:17,018 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-18 09:26:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:17,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:17,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:17,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,406 INFO 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-02-18 09:26:17,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:17,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:17,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:17,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-18 09:26:17,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:17,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:26:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:26:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:26:17,765 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-18 09:26:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:19,192 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-18 09:26:19,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:26:19,195 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-18 09:26:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:19,196 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:26:19,197 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:26:19,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-18 09:26:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:26:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-18 09:26:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:26:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-18 09:26:19,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-18 09:26:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:19,208 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-18 09:26:19,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:26:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-18 09:26:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:26:19,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:19,210 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-18 09:26:19,210 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-18 09:26:19,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:19,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:19,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:19,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:19,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,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 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-02-18 09:26:19,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:19,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:19,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:26:19,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:19,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:20,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-18 09:26:20,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:20,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:26:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:26:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:26:20,119 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-18 09:26:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:20,649 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-18 09:26:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:26:20,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-18 09:26:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:20,651 INFO L225 Difference]: With dead ends: 135 [2019-02-18 09:26:20,651 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:26:20,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:26:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-18 09:26:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:26:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-18 09:26:20,668 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-18 09:26:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:20,671 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-18 09:26:20,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:26:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-18 09:26:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:26:20,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:20,672 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-18 09:26:20,672 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-18 09:26:20,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:20,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:20,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:20,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:21,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:21,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:21,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:21,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:21,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 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-02-18 09:26:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:21,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:21,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:21,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-18 09:26:21,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:21,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:26:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:26:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:26:21,579 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-18 09:26:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:23,349 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-18 09:26:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:26:23,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-18 09:26:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:23,350 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:26:23,350 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:26:23,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:26:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-18 09:26:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:26:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-18 09:26:23,361 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-18 09:26:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:23,361 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-18 09:26:23,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:26:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-18 09:26:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:26:23,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:23,362 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-18 09:26:23,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-18 09:26:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:23,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:23,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:23,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:23,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:23,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:23,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,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 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-02-18 09:26:23,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:23,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-18 09:26:24,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:24,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:26:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:26:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:26:24,914 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-18 09:26:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:25,295 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-18 09:26:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:26:25,295 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-18 09:26:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:25,296 INFO L225 Difference]: With dead ends: 150 [2019-02-18 09:26:25,296 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:26:25,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:26:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:26:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-18 09:26:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:26:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-18 09:26:25,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-18 09:26:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:25,306 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-18 09:26:25,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:26:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-18 09:26:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:26:25,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:25,307 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-18 09:26:25,307 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-18 09:26:25,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:25,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:25,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:25,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:25,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:25,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:25,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:25,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:25,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:25,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:25,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:25,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:26:25,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:25,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:26,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:27,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-18 09:26:27,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:27,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:26:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:26:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:26:27,619 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-18 09:26:30,285 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-18 09:26:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:32,200 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-18 09:26:32,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:26:32,201 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-18 09:26:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:32,202 INFO L225 Difference]: With dead ends: 192 [2019-02-18 09:26:32,202 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:26:32,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:26:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:26:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-18 09:26:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:26:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-18 09:26:32,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-18 09:26:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:32,217 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-18 09:26:32,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:26:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-18 09:26:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:26:32,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:32,217 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-18 09:26:32,218 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-18 09:26:32,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:33,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:33,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:33,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:33,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:33,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:33,344 INFO 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-02-18 09:26:33,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:33,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:33,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:33,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:33,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:33,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:33,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:33,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-18 09:26:33,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:33,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:26:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:26:33,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:33,860 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-18 09:26:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:36,168 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-18 09:26:36,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:26:36,171 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-18 09:26:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:36,172 INFO L225 Difference]: With dead ends: 169 [2019-02-18 09:26:36,172 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 09:26:36,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:26:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 09:26:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-18 09:26:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:26:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-18 09:26:36,182 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-18 09:26:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:36,182 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-18 09:26:36,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:26:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-18 09:26:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:26:36,183 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:36,183 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-18 09:26:36,183 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-18 09:26:36,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:36,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:36,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:36,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:36,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:36,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:36,504 INFO 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-02-18 09:26:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:36,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:36,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:36,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:37,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:37,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-18 09:26:37,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:26:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:26:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:37,037 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-18 09:26:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:37,551 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-18 09:26:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:26:37,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-18 09:26:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:37,553 INFO L225 Difference]: With dead ends: 180 [2019-02-18 09:26:37,553 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:26:37,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:26:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-18 09:26:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:26:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-18 09:26:37,566 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-18 09:26:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:37,566 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-18 09:26:37,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:26:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-18 09:26:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:26:37,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:37,567 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-18 09:26:37,567 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-18 09:26:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:38,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:38,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:38,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:38,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:38,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:38,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:26:38,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:38,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:39,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:40,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-18 09:26:40,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:26:40,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:26:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-18 09:26:40,531 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-18 09:26:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:46,667 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-18 09:26:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:26:46,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-18 09:26:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:46,669 INFO L225 Difference]: With dead ends: 230 [2019-02-18 09:26:46,669 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:26:46,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-18 09:26:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:26:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-18 09:26:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:26:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-18 09:26:46,688 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-18 09:26:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:46,688 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-18 09:26:46,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:26:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-18 09:26:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:26:46,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:46,689 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-18 09:26:46,689 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-18 09:26:46,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:47,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:47,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:47,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:47,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,433 INFO 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-02-18 09:26:47,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:47,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:47,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:47,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:47,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:47,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:48,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:48,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-18 09:26:48,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:48,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:26:48,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:26:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:48,054 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-18 09:26:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:51,276 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-18 09:26:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:26:51,276 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-18 09:26:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:51,278 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:26:51,278 INFO L226 Difference]: Without dead ends: 149 [2019-02-18 09:26:51,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-18 09:26:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-18 09:26:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:26:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-18 09:26:51,292 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-18 09:26:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:51,292 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-18 09:26:51,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:26:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-18 09:26:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 09:26:51,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:51,293 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-18 09:26:51,293 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:51,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-18 09:26:51,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:51,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:51,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:51,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:51,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:51,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,644 INFO 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-02-18 09:26:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:51,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:51,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:52,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-18 09:26:52,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:52,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:26:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:26:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:52,774 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-18 09:26:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:53,446 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-18 09:26:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:26:53,447 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-18 09:26:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:53,448 INFO L225 Difference]: With dead ends: 210 [2019-02-18 09:26:53,449 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:26:53,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:26:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-18 09:26:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:26:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-18 09:26:53,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-18 09:26:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:53,464 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-18 09:26:53,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:26:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-18 09:26:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:26:53,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:53,464 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-18 09:26:53,465 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-18 09:26:53,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:53,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:53,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:54,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:54,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:54,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:54,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:54,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:54,104 INFO 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-02-18 09:26:54,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:54,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:54,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:26:54,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:54,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:54,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:54,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-18 09:26:54,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:54,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:26:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:26:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:26:54,948 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-18 09:26:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:58,558 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-18 09:26:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:26:58,559 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-18 09:26:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:58,560 INFO L225 Difference]: With dead ends: 214 [2019-02-18 09:26:58,560 INFO L226 Difference]: Without dead ends: 160 [2019-02-18 09:26:58,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-18 09:26:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-18 09:26:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-18 09:26:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:26:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-18 09:26:58,577 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-18 09:26:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:58,577 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-18 09:26:58,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:26:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-18 09:26:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:26:58,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:58,578 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-18 09:26:58,578 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-18 09:26:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:58,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:59,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:59,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:59,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:59,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,355 INFO 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-02-18 09:26:59,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:59,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:59,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:59,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:59,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:59,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:00,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-18 09:27:00,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:00,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:27:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:27:00,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:27:00,049 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-18 09:27:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:00,970 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-18 09:27:00,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:27:00,971 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-18 09:27:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:00,972 INFO L225 Difference]: With dead ends: 225 [2019-02-18 09:27:00,972 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:27:00,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:27:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:27:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-18 09:27:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:27:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-18 09:27:00,992 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-18 09:27:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:00,992 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-18 09:27:00,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:27:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-18 09:27:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 09:27:00,993 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:00,993 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-18 09:27:00,993 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-18 09:27:00,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:00,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:00,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:01,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:01,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:01,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:01,970 INFO 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-02-18 09:27:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:01,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:02,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:02,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-18 09:27:02,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:02,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:27:02,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:27:02,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:27:02,731 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-18 09:27:05,853 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-18 09:27:07,401 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-18 09:27:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:07,730 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-18 09:27:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:27:07,730 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-18 09:27:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:07,732 INFO L225 Difference]: With dead ends: 229 [2019-02-18 09:27:07,732 INFO L226 Difference]: Without dead ends: 171 [2019-02-18 09:27:07,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:27:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-18 09:27:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-18 09:27:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 09:27:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-18 09:27:07,757 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-18 09:27:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:07,758 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-18 09:27:07,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:27:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-18 09:27:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 09:27:07,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:07,759 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-18 09:27:07,759 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-18 09:27:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:07,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:07,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:07,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:08,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:08,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:08,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:08,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:08,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:08,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:27:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:08,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:08,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:27:08,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:08,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:08,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:09,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:09,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-18 09:27:09,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:09,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:27:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:27:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:27:09,091 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-18 09:27:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:09,629 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-18 09:27:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:27:09,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-18 09:27:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:09,630 INFO L225 Difference]: With dead ends: 240 [2019-02-18 09:27:09,630 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:27:09,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:27:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:27:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-18 09:27:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 09:27:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-18 09:27:09,648 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-18 09:27:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:09,648 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-18 09:27:09,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:27:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-18 09:27:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 09:27:09,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:09,649 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-18 09:27:09,649 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-18 09:27:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:09,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:09,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:09,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:09,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:10,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:10,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:10,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:10,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:10,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:10,420 INFO 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-02-18 09:27:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:10,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:10,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:10,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:10,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:11,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:11,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:11,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-18 09:27:11,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:11,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:27:11,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:27:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:27:11,588 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-18 09:27:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:16,675 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-18 09:27:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:27:16,682 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-18 09:27:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:16,683 INFO L225 Difference]: With dead ends: 244 [2019-02-18 09:27:16,683 INFO L226 Difference]: Without dead ends: 182 [2019-02-18 09:27:16,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:27:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-18 09:27:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-18 09:27:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-18 09:27:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-18 09:27:16,705 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-18 09:27:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:16,705 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-18 09:27:16,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:27:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-18 09:27:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-18 09:27:16,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:16,706 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-18 09:27:16,706 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-18 09:27:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:16,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:16,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:16,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:16,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:17,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:17,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:17,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:17,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:17,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:17,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 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-02-18 09:27:17,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:17,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:17,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:17,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:18,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:18,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-18 09:27:18,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:18,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:27:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:27:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:27:18,156 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-18 09:27:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:19,117 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-18 09:27:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:27:19,117 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-18 09:27:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:19,119 INFO L225 Difference]: With dead ends: 255 [2019-02-18 09:27:19,119 INFO L226 Difference]: Without dead ends: 124 [2019-02-18 09:27:19,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:27:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-18 09:27:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-18 09:27:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-18 09:27:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-18 09:27:19,137 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-18 09:27:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:19,137 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-18 09:27:19,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:27:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-18 09:27:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-18 09:27:19,138 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:19,138 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-18 09:27:19,138 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-18 09:27:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:19,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:20,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:20,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:20,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:20,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:20,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:20,230 INFO 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-02-18 09:27:20,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:20,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:20,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:27:20,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:20,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:22,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:24,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-18 09:27:24,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:27:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:27:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:24,308 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-18 09:27:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:34,811 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-18 09:27:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-18 09:27:34,811 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-18 09:27:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:34,813 INFO L225 Difference]: With dead ends: 325 [2019-02-18 09:27:34,813 INFO L226 Difference]: Without dead ends: 190 [2019-02-18 09:27:34,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:27:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-18 09:27:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-18 09:27:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:27:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-18 09:27:34,836 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-18 09:27:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:34,836 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-18 09:27:34,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:27:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-18 09:27:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:27:34,837 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:34,837 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-18 09:27:34,838 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-18 09:27:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:34,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:34,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:35,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:35,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:35,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:35,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:35,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:35,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:27:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:35,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:35,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:35,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:35,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:37,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:37,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-18 09:27:37,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:37,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:27:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:27:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:27:37,371 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-18 09:27:41,424 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-02-18 09:27:41,619 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-18 09:27:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:42,869 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-18 09:27:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:27:42,869 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-18 09:27:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:42,871 INFO L225 Difference]: With dead ends: 274 [2019-02-18 09:27:42,871 INFO L226 Difference]: Without dead ends: 204 [2019-02-18 09:27:42,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:27:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-18 09:27:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-18 09:27:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:27:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-18 09:27:42,891 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-18 09:27:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:42,891 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-18 09:27:42,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:27:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-18 09:27:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:27:42,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:42,892 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-18 09:27:42,892 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-18 09:27:42,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:42,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:42,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:42,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:42,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:44,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:44,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:44,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:44,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:44,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:44,174 INFO 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-02-18 09:27:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:44,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:44,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:44,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:45,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-18 09:27:45,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:45,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:27:45,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:27:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:27:45,317 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-18 09:27:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:46,192 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-18 09:27:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:27:46,192 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-18 09:27:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:46,194 INFO L225 Difference]: With dead ends: 285 [2019-02-18 09:27:46,194 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:27:46,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:27:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:27:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-18 09:27:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 09:27:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-18 09:27:46,218 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-18 09:27:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:46,218 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-18 09:27:46,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:27:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-18 09:27:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-18 09:27:46,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:46,219 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-18 09:27:46,219 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-18 09:27:46,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:46,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:47,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:47,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:47,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:47,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:47,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:47,544 INFO 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-02-18 09:27:47,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:47,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:47,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:27:47,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:47,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:50,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:52,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-18 09:27:52,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:52,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:27:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:27:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:52,493 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-18 09:28:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:05,958 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-18 09:28:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-18 09:28:05,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-18 09:28:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:05,961 INFO L225 Difference]: With dead ends: 363 [2019-02-18 09:28:05,961 INFO L226 Difference]: Without dead ends: 212 [2019-02-18 09:28:05,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 09:28:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-18 09:28:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-18 09:28:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-18 09:28:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-18 09:28:05,984 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-18 09:28:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:05,984 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-18 09:28:05,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:28:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-18 09:28:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-18 09:28:05,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:05,985 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-18 09:28:05,985 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-18 09:28:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:05,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:05,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:07,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:07,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:07,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:07,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:07,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:07,526 INFO 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-02-18 09:28:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:07,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:07,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:07,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:07,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:09,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:09,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:09,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-18 09:28:09,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:09,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:28:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:28:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:28:09,791 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-18 09:28:14,199 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:28:14,474 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:28:14,741 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-18 09:28:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:16,565 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-18 09:28:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:28:16,566 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-18 09:28:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:16,567 INFO L225 Difference]: With dead ends: 304 [2019-02-18 09:28:16,567 INFO L226 Difference]: Without dead ends: 226 [2019-02-18 09:28:16,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-18 09:28:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-18 09:28:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-18 09:28:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-18 09:28:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-18 09:28:16,593 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-18 09:28:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:16,593 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-18 09:28:16,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:28:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-18 09:28:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-18 09:28:16,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:16,595 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-18 09:28:16,595 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-18 09:28:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:16,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:16,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:17,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:17,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:17,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:17,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:17,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:17,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:28:17,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:17,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:17,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:18,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:18,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:18,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-18 09:28:18,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:18,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:28:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:28:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:28:18,916 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-18 09:28:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:20,207 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-18 09:28:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:28:20,208 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-18 09:28:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:20,209 INFO L225 Difference]: With dead ends: 315 [2019-02-18 09:28:20,209 INFO L226 Difference]: Without dead ends: 152 [2019-02-18 09:28:20,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:28:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-18 09:28:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-18 09:28:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-18 09:28:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-18 09:28:20,243 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-18 09:28:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:20,243 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-18 09:28:20,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:28:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-18 09:28:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-18 09:28:20,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:20,244 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-18 09:28:20,244 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-18 09:28:20,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:20,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:20,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:21,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:21,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:21,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:28:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:21,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:21,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:28:21,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:21,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:25,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:27,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:27,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-18 09:28:27,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:27,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:28:27,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:28:27,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:28:27,906 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-18 09:28:39,566 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:28:39,875 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:28:40,184 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:28:40,452 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:28:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:43,289 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-18 09:28:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-18 09:28:43,290 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-18 09:28:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:43,291 INFO L225 Difference]: With dead ends: 401 [2019-02-18 09:28:43,292 INFO L226 Difference]: Without dead ends: 234 [2019-02-18 09:28:43,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-18 09:28:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-18 09:28:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-18 09:28:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:28:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-18 09:28:43,322 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-18 09:28:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:43,322 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-18 09:28:43,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:28:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-18 09:28:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:28:43,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:43,323 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-18 09:28:43,323 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-18 09:28:43,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:43,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:43,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:43,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:43,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:45,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:45,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:45,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:45,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:45,180 INFO 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-02-18 09:28:45,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:45,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:45,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:45,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:45,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:46,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:46,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:46,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-18 09:28:46,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:28:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:28:46,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:28:46,678 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-18 09:28:52,438 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:28:52,750 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:28:53,092 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:28:53,320 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:28:53,507 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:28:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:55,441 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-18 09:28:55,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:28:55,441 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-18 09:28:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:55,443 INFO L225 Difference]: With dead ends: 334 [2019-02-18 09:28:55,443 INFO L226 Difference]: Without dead ends: 248 [2019-02-18 09:28:55,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:28:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-18 09:28:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-18 09:28:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:28:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-18 09:28:55,470 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-18 09:28:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:55,471 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-18 09:28:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:28:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-18 09:28:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:28:55,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:55,472 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-18 09:28:55,472 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-18 09:28:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:55,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:55,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:56,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:56,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:56,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:56,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:56,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:56,615 INFO 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-02-18 09:28:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:56,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:56,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:57,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:58,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-18 09:28:58,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:58,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:28:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:28:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:28:58,380 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-18 09:29:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:00,020 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-18 09:29:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:29:00,022 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-18 09:29:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:00,023 INFO L225 Difference]: With dead ends: 345 [2019-02-18 09:29:00,023 INFO L226 Difference]: Without dead ends: 166 [2019-02-18 09:29:00,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:29:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-18 09:29:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-18 09:29:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-18 09:29:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-18 09:29:00,050 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-18 09:29:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:00,050 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-18 09:29:00,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:29:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-18 09:29:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-18 09:29:00,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:00,051 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-18 09:29:00,051 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-18 09:29:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:00,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:00,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:01,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:01,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:01,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:01,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:01,804 INFO 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-02-18 09:29:01,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:01,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:01,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:29:01,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:03,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-18 09:29:03,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:03,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:29:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:29:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:29:03,656 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-18 09:29:10,656 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:29:10,972 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:29:11,272 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:29:11,481 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:29:11,678 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:29:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:14,038 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-18 09:29:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 09:29:14,039 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-18 09:29:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:14,041 INFO L225 Difference]: With dead ends: 349 [2019-02-18 09:29:14,041 INFO L226 Difference]: Without dead ends: 259 [2019-02-18 09:29:14,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:29:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-18 09:29:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-18 09:29:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-18 09:29:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-18 09:29:14,070 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-18 09:29:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:14,070 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-18 09:29:14,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:29:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-18 09:29:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-18 09:29:14,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:14,071 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-18 09:29:14,071 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-18 09:29:14,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:14,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:14,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:15,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:15,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:15,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:15,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:15,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:15,051 INFO 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-02-18 09:29:15,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:15,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:15,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:15,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:15,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:16,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-18 09:29:16,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:16,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:29:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:29:16,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:29:16,795 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-18 09:29:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:18,725 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-18 09:29:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:29:18,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-18 09:29:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:18,726 INFO L225 Difference]: With dead ends: 360 [2019-02-18 09:29:18,726 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:29:18,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:29:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:29:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-18 09:29:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-18 09:29:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-18 09:29:18,755 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-18 09:29:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:18,755 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-18 09:29:18,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:29:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-18 09:29:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-18 09:29:18,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:18,756 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-18 09:29:18,756 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-18 09:29:18,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:20,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:20,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:20,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:20,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,428 INFO 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-02-18 09:29:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:20,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:20,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:22,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:22,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:22,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-18 09:29:22,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:22,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:29:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:29:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:29:22,350 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-18 09:29:29,982 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:29:30,320 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:29:30,645 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:29:30,871 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:29:31,084 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:29:31,288 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:29:31,491 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:29:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:33,597 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-18 09:29:33,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 09:29:33,597 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-18 09:29:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:33,599 INFO L225 Difference]: With dead ends: 364 [2019-02-18 09:29:33,599 INFO L226 Difference]: Without dead ends: 270 [2019-02-18 09:29:33,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:29:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-18 09:29:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-18 09:29:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-18 09:29:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-18 09:29:33,636 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-18 09:29:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:33,636 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-18 09:29:33,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:29:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-18 09:29:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-18 09:29:33,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:33,637 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-18 09:29:33,637 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-18 09:29:33,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:33,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:33,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:35,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:35,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:35,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:35,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:35,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:35,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:29:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:35,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:35,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:29:35,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:35,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:36,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-18 09:29:37,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:37,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:29:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:29:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:29:37,685 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-18 09:29:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:39,815 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-18 09:29:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:29:39,815 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-18 09:29:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:39,817 INFO L225 Difference]: With dead ends: 375 [2019-02-18 09:29:39,817 INFO L226 Difference]: Without dead ends: 180 [2019-02-18 09:29:39,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:29:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-18 09:29:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-18 09:29:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-18 09:29:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-18 09:29:39,849 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-18 09:29:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:39,849 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-18 09:29:39,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:29:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-18 09:29:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-18 09:29:39,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:39,850 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-18 09:29:39,850 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-18 09:29:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:39,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:39,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:42,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:42,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:42,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:42,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:42,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:29:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:42,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:42,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:42,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:42,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:43,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:43,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:43,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-18 09:29:43,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:43,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:29:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:29:43,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:29:43,941 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-18 09:29:50,376 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:29:50,743 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:29:51,090 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:29:51,341 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:29:51,567 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:29:51,787 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:29:52,003 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:29:52,207 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:29:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:54,398 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-18 09:29:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 09:29:54,398 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-18 09:29:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:54,400 INFO L225 Difference]: With dead ends: 379 [2019-02-18 09:29:54,401 INFO L226 Difference]: Without dead ends: 281 [2019-02-18 09:29:54,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:29:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-18 09:29:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-18 09:29:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-18 09:29:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-18 09:29:54,441 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-18 09:29:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:54,441 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-18 09:29:54,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:29:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-18 09:29:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-18 09:29:54,442 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:54,442 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-18 09:29:54,443 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-18 09:29:54,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:54,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:54,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:54,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:54,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:55,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:55,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:55,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:55,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:55,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:55,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:29:55,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:55,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:55,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:56,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:57,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:57,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-18 09:29:57,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:57,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:29:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:29:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:29:57,453 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-18 09:29:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:59,344 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-18 09:29:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:29:59,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-18 09:29:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:59,346 INFO L225 Difference]: With dead ends: 390 [2019-02-18 09:29:59,346 INFO L226 Difference]: Without dead ends: 187 [2019-02-18 09:29:59,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:29:59,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-18 09:29:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-18 09:29:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 09:29:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-18 09:29:59,387 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-18 09:29:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:59,387 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-18 09:29:59,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:29:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-18 09:29:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 09:29:59,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:59,388 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-18 09:29:59,388 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-18 09:29:59,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:59,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:02,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:02,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:02,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:02,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:02,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:02,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:30:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:02,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:02,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:30:02,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:02,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:06,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:11,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-18 09:30:11,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:11,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 09:30:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 09:30:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:30:11,008 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-18 09:30:28,574 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:30:29,021 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:30:29,490 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:30:29,882 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:30:30,284 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:30:30,744 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:30:31,079 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:30:31,414 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:30:31,724 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:30:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:34,858 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-18 09:30:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-18 09:30:34,859 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-18 09:30:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:34,860 INFO L225 Difference]: With dead ends: 496 [2019-02-18 09:30:34,861 INFO L226 Difference]: Without dead ends: 289 [2019-02-18 09:30:34,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-18 09:30:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-18 09:30:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-18 09:30:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-18 09:30:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-18 09:30:34,897 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-18 09:30:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:34,897 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-18 09:30:34,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 09:30:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-18 09:30:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-18 09:30:34,898 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:34,898 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-18 09:30:34,898 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-18 09:30:34,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:34,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:34,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:37,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:37,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:37,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:37,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:37,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:37,202 INFO 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-02-18 09:30:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:37,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:37,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:37,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:37,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:39,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:39,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-18 09:30:39,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:39,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:30:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:30:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:30:39,511 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-18 09:30:48,022 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:30:48,415 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:30:48,812 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:30:49,090 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:30:49,349 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:30:49,596 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:30:49,849 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:30:50,073 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:30:50,300 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:30:50,518 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:30:50,761 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-18 09:30:51,016 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-18 09:30:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:52,947 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-18 09:30:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-18 09:30:52,948 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-18 09:30:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:52,949 INFO L225 Difference]: With dead ends: 409 [2019-02-18 09:30:52,949 INFO L226 Difference]: Without dead ends: 303 [2019-02-18 09:30:52,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:30:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-18 09:30:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-18 09:30:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-18 09:30:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-18 09:30:52,988 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-18 09:30:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:52,989 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-18 09:30:52,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:30:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-18 09:30:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-18 09:30:52,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:52,990 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-18 09:30:52,990 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-18 09:30:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:52,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:52,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:54,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:54,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:54,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:54,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:54,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:54,143 INFO 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-02-18 09:30:54,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:54,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:54,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:55,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:56,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:56,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-18 09:30:56,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:56,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:30:56,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:30:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:30:56,962 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-18 09:30:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:59,238 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-18 09:30:59,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:30:59,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-18 09:30:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:59,240 INFO L225 Difference]: With dead ends: 420 [2019-02-18 09:30:59,240 INFO L226 Difference]: Without dead ends: 201 [2019-02-18 09:30:59,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:30:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-18 09:30:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-18 09:30:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-18 09:30:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-18 09:30:59,277 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-18 09:30:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:59,277 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-18 09:30:59,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:30:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-18 09:30:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-18 09:30:59,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:59,278 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-18 09:30:59,278 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-18 09:30:59,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:59,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:01,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:01,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:01,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:01,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:01,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:01,463 INFO 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-02-18 09:31:01,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:01,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:01,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:31:01,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:01,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:03,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:03,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:03,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-18 09:31:03,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:03,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:31:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:31:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:31:03,733 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-18 09:31:12,297 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:31:12,728 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:31:13,129 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:31:13,420 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:31:13,702 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:31:13,973 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:31:14,243 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:31:14,500 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:31:14,745 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:31:14,984 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:31:15,204 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:31:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:17,661 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-18 09:31:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-18 09:31:17,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-18 09:31:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:17,663 INFO L225 Difference]: With dead ends: 424 [2019-02-18 09:31:17,663 INFO L226 Difference]: Without dead ends: 314 [2019-02-18 09:31:17,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:31:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-18 09:31:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-18 09:31:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-18 09:31:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-18 09:31:17,714 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-18 09:31:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:17,714 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-18 09:31:17,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:31:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-18 09:31:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-18 09:31:17,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:17,715 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-18 09:31:17,715 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-18 09:31:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:17,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:17,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:18,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:18,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:18,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:18,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:18,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:18,840 INFO 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-02-18 09:31:18,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:18,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:18,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:18,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:18,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:20,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:21,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:21,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-18 09:31:21,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:21,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:31:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:31:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:31:21,258 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-18 09:31:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:23,815 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-18 09:31:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:31:23,815 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-18 09:31:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:23,817 INFO L225 Difference]: With dead ends: 435 [2019-02-18 09:31:23,817 INFO L226 Difference]: Without dead ends: 208 [2019-02-18 09:31:23,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:31:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-18 09:31:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-18 09:31:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-18 09:31:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-18 09:31:23,866 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-18 09:31:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:23,867 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-18 09:31:23,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:31:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-18 09:31:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-18 09:31:23,868 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:23,868 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-18 09:31:23,868 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-18 09:31:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:23,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:23,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:26,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:26,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:26,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:26,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:26,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:26,025 INFO 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-02-18 09:31:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:26,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:26,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:28,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:28,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:28,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-18 09:31:28,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:28,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:31:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:31:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:31:28,610 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-18 09:31:37,854 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:31:38,302 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:31:38,738 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:31:39,040 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:31:39,334 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:31:39,619 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:31:39,903 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:31:40,173 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:31:40,431 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:31:40,677 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:31:40,918 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:31:41,154 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:31:42,014 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-18 09:31:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:43,687 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-18 09:31:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-18 09:31:43,688 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-18 09:31:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:43,689 INFO L225 Difference]: With dead ends: 439 [2019-02-18 09:31:43,689 INFO L226 Difference]: Without dead ends: 325 [2019-02-18 09:31:43,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:31:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-18 09:31:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-18 09:31:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-18 09:31:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-18 09:31:43,741 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-18 09:31:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:43,741 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-18 09:31:43,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:31:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-18 09:31:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-18 09:31:43,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:43,743 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-18 09:31:43,743 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-18 09:31:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:44,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:44,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:44,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:44,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:44,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 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-02-18 09:31:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:45,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:45,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:31:45,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:45,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:46,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:48,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:48,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-18 09:31:48,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:48,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:31:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:31:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:31:48,070 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-18 09:31:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:50,647 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-18 09:31:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:31:50,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-18 09:31:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:50,649 INFO L225 Difference]: With dead ends: 450 [2019-02-18 09:31:50,649 INFO L226 Difference]: Without dead ends: 215 [2019-02-18 09:31:50,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:31:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-18 09:31:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-18 09:31:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:31:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-18 09:31:50,698 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-18 09:31:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:50,699 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-18 09:31:50,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:31:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-18 09:31:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 09:31:50,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:50,700 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-18 09:31:50,700 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-18 09:31:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:50,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:50,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:53,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:53,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:53,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:53,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:53,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:53,160 INFO 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-02-18 09:31:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:53,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:53,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:53,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:53,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:55,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:56,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-18 09:31:56,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:56,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:31:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:31:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:31:56,108 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-18 09:32:06,514 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 09:32:06,950 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 09:32:07,380 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:32:07,764 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:32:08,065 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:32:08,351 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:32:08,630 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:32:08,904 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:32:09,166 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:32:09,420 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:32:09,679 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:32:09,920 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:32:10,144 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:32:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:12,637 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-18 09:32:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-18 09:32:12,638 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-18 09:32:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:12,640 INFO L225 Difference]: With dead ends: 454 [2019-02-18 09:32:12,640 INFO L226 Difference]: Without dead ends: 336 [2019-02-18 09:32:12,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:32:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-18 09:32:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-18 09:32:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 09:32:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-18 09:32:12,691 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-18 09:32:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:12,691 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-18 09:32:12,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:32:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-18 09:32:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-18 09:32:12,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:12,692 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-18 09:32:12,692 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-18 09:32:12,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:12,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:12,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:14,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:14,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:14,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:14,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:14,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:14,093 INFO 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-02-18 09:32:14,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:14,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:14,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:15,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:16,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:16,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-18 09:32:16,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:16,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:32:16,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:32:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:32:16,852 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-18 09:32:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:19,840 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-18 09:32:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:32:19,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-18 09:32:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:19,841 INFO L225 Difference]: With dead ends: 465 [2019-02-18 09:32:19,841 INFO L226 Difference]: Without dead ends: 222 [2019-02-18 09:32:19,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:32:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-18 09:32:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-18 09:32:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-18 09:32:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-18 09:32:19,886 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-18 09:32:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:19,886 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-18 09:32:19,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:32:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-18 09:32:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-18 09:32:19,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:19,887 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-18 09:32:19,887 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-18 09:32:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:19,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:19,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:22,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:22,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:22,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:22,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:22,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:22,160 INFO 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-02-18 09:32:22,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:22,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:22,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:32:22,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:22,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:28,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:34,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-18 09:32:34,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-18 09:32:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-18 09:32:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:32:34,257 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-18 09:32:58,410 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 09:32:59,068 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 09:32:59,668 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 09:33:00,184 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:33:00,657 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:33:01,122 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:33:01,575 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:33:02,020 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:33:02,452 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:33:02,868 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:33:03,261 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:33:03,657 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:33:04,111 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:33:04,479 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:33:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:08,014 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-18 09:33:08,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-18 09:33:08,014 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-18 09:33:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:08,016 INFO L225 Difference]: With dead ends: 591 [2019-02-18 09:33:08,016 INFO L226 Difference]: Without dead ends: 344 [2019-02-18 09:33:08,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-18 09:33:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-18 09:33:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-18 09:33:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-18 09:33:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-18 09:33:08,066 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-18 09:33:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:08,066 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-18 09:33:08,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-18 09:33:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-18 09:33:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-18 09:33:08,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:08,067 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-18 09:33:08,067 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-18 09:33:08,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:08,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:08,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:10,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:10,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:10,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:10,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 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-02-18 09:33:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:10,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:10,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:10,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:10,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:13,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:13,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:13,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-18 09:33:13,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:13,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:33:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:33:13,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:33:13,500 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-18 09:33:26,403 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 09:33:26,894 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 09:33:27,382 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 09:33:27,719 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:33:28,049 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:33:28,366 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:33:28,683 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:33:29,027 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:33:29,329 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:33:29,710 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:33:29,987 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:33:30,250 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:33:30,503 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:33:30,751 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:33:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:33,609 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-18 09:33:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-18 09:33:33,610 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-18 09:33:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:33,612 INFO L225 Difference]: With dead ends: 484 [2019-02-18 09:33:33,612 INFO L226 Difference]: Without dead ends: 358 [2019-02-18 09:33:33,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 09:33:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-18 09:33:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-18 09:33:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-18 09:33:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-18 09:33:33,664 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-18 09:33:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:33,664 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-18 09:33:33,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:33:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-18 09:33:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-18 09:33:33,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:33,665 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-18 09:33:33,666 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-18 09:33:33,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:33,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:35,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:35,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:35,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:35,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:35,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:35,348 INFO 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-02-18 09:33:35,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:35,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:33:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:35,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:38,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:40,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:40,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-18 09:33:40,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:40,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:33:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:33:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:33:40,753 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-18 09:33:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:43,070 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-18 09:33:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:33:43,070 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-18 09:33:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:43,072 INFO L225 Difference]: With dead ends: 495 [2019-02-18 09:33:43,072 INFO L226 Difference]: Without dead ends: 236 [2019-02-18 09:33:43,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:33:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-18 09:33:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-18 09:33:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-18 09:33:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-18 09:33:43,125 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-18 09:33:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:43,125 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-18 09:33:43,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:33:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-18 09:33:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-18 09:33:43,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:43,126 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-18 09:33:43,126 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-18 09:33:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:43,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:43,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:45,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:45,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:45,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:45,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:45,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:45,874 INFO 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-02-18 09:33:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:45,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:45,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 09:33:45,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:45,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:52,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:58,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:58,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-18 09:33:58,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:58,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-18 09:33:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-18 09:33:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:33:58,840 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-18 09:34:24,274 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 09:34:24,879 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 09:34:25,496 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 09:34:26,117 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:34:26,674 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:34:27,192 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:34:27,689 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:34:28,174 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:34:28,653 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:34:29,112 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:34:29,556 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:34:29,984 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:34:30,396 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:34:30,794 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:34:31,271 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:34:31,637 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:34:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:35,399 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-18 09:34:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-18 09:34:35,399 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-18 09:34:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:35,401 INFO L225 Difference]: With dead ends: 629 [2019-02-18 09:34:35,401 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 09:34:35,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-18 09:34:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 09:34:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-18 09:34:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-18 09:34:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-18 09:34:35,457 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-18 09:34:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:35,457 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-18 09:34:35,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-18 09:34:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-18 09:34:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-18 09:34:35,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:35,458 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-18 09:34:35,459 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-18 09:34:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:35,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:35,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:38,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:38,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:38,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:38,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:38,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:38,389 INFO 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-02-18 09:34:38,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:38,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:38,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:38,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:38,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:41,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-18 09:34:41,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:41,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:34:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:34:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:34:41,692 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-18 09:34:53,489 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 09:34:54,035 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 09:34:54,561 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 09:34:54,957 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 09:34:55,338 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:34:55,696 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:34:56,042 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:34:56,382 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:34:56,788 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:34:57,121 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:34:57,444 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:34:57,756 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:34:58,063 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:34:58,356 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:34:58,623 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:34:58,885 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:34:59,131 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:35:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:02,122 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-18 09:35:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-18 09:35:02,123 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-18 09:35:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:02,124 INFO L225 Difference]: With dead ends: 514 [2019-02-18 09:35:02,124 INFO L226 Difference]: Without dead ends: 380 [2019-02-18 09:35:02,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 09:35:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-18 09:35:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-18 09:35:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-18 09:35:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-18 09:35:02,194 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-18 09:35:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:02,194 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-18 09:35:02,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:35:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-18 09:35:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-18 09:35:02,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:02,195 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-18 09:35:02,196 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-18 09:35:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:02,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:02,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:02,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:03,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:03,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:03,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:03,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:03,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:03,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:35:03,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:03,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:03,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:06,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-18 09:35:07,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:35:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:35:07,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:35:07,753 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-18 09:35:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:10,361 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-18 09:35:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:35:10,361 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-18 09:35:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:10,363 INFO L225 Difference]: With dead ends: 525 [2019-02-18 09:35:10,363 INFO L226 Difference]: Without dead ends: 250 [2019-02-18 09:35:10,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:35:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-18 09:35:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-18 09:35:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-18 09:35:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-18 09:35:10,445 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-18 09:35:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:10,445 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-18 09:35:10,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:35:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-18 09:35:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-18 09:35:10,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:10,446 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-18 09:35:10,447 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-18 09:35:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:10,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:10,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:13,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:13,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:13,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:13,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:13,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:13,460 INFO 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-02-18 09:35:13,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:13,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:35:13,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:35:13,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:13,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:20,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:28,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:28,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-18 09:35:28,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:28,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-18 09:35:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-18 09:35:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:35:28,243 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-18 09:35:55,911 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 09:35:56,559 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 09:35:57,206 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 09:35:57,821 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 09:35:58,449 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 09:35:59,039 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:35:59,616 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:36:00,162 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:36:00,711 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:36:01,260 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:36:01,758 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:36:02,237 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:36:02,712 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:36:03,247 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:36:03,702 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:36:04,128 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:36:04,532 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:36:04,925 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:36:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:09,095 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-18 09:36:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-18 09:36:09,096 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-18 09:36:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:09,098 INFO L225 Difference]: With dead ends: 667 [2019-02-18 09:36:09,098 INFO L226 Difference]: Without dead ends: 388 [2019-02-18 09:36:09,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-18 09:36:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-18 09:36:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-18 09:36:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-18 09:36:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-18 09:36:09,162 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-18 09:36:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-18 09:36:09,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-18 09:36:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-18 09:36:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-18 09:36:09,164 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:09,164 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-18 09:36:09,164 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-18 09:36:09,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:09,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:09,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:12,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:12,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:12,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:12,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:12,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:12,043 INFO 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-02-18 09:36:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:12,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:12,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:12,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:12,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:15,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:15,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:15,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-18 09:36:15,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:15,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 09:36:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 09:36:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:36:15,743 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-18 09:36:29,692 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 09:36:30,286 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 09:36:30,852 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 09:36:31,252 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 09:36:31,654 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 09:36:32,047 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 09:36:32,434 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:36:32,791 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:36:33,142 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:36:33,495 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:36:33,912 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:36:34,274 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:36:34,597 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:36:34,910 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:36:35,223 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:36:35,517 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:36:35,804 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:36:36,083 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:36:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:39,462 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-18 09:36:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-18 09:36:39,462 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-18 09:36:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:39,464 INFO L225 Difference]: With dead ends: 544 [2019-02-18 09:36:39,464 INFO L226 Difference]: Without dead ends: 402 [2019-02-18 09:36:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 09:36:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-18 09:36:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-18 09:36:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-18 09:36:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-18 09:36:39,527 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-18 09:36:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:39,527 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-18 09:36:39,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 09:36:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-18 09:36:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-18 09:36:39,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:39,529 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-18 09:36:39,529 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-18 09:36:39,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:39,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:39,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:39,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:39,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:41,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:41,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:41,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:41,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,257 INFO 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-02-18 09:36:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:41,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:36:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:41,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:43,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-18 09:36:45,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:45,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 09:36:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 09:36:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:36:45,386 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-18 09:36:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:48,302 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-18 09:36:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:36:48,303 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-18 09:36:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:48,305 INFO L225 Difference]: With dead ends: 555 [2019-02-18 09:36:48,305 INFO L226 Difference]: Without dead ends: 264 [2019-02-18 09:36:48,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:36:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-18 09:36:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-18 09:36:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-18 09:36:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-18 09:36:48,366 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-18 09:36:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-18 09:36:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 09:36:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-18 09:36:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-18 09:36:48,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:48,367 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-18 09:36:48,367 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-18 09:36:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:48,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:51,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:51,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:51,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:51,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:51,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:51,623 INFO 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-02-18 09:36:51,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:36:51,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:36:51,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 09:36:51,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:51,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:00,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:07,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:07,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-18 09:37:07,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:07,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-18 09:37:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-18 09:37:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:37:07,981 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-18 09:37:39,404 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 09:37:40,120 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 09:37:40,917 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 09:37:41,592 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-18 09:37:42,245 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 09:37:42,875 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 09:37:43,485 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 09:37:44,078 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:37:44,665 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:37:45,276 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:37:45,869 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:37:46,416 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:37:46,951 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:37:47,464 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:37:47,964 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:37:48,447 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:37:48,901 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:37:49,344 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:37:49,774 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:37:50,184 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:37:50,589 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-18 09:37:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:54,477 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-18 09:37:54,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-18 09:37:54,477 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-18 09:37:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:54,479 INFO L225 Difference]: With dead ends: 705 [2019-02-18 09:37:54,479 INFO L226 Difference]: Without dead ends: 410 [2019-02-18 09:37:54,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-18 09:37:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-18 09:37:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-18 09:37:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-18 09:37:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-18 09:37:54,553 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-18 09:37:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:54,554 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-18 09:37:54,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-18 09:37:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-18 09:37:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-18 09:37:54,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:54,555 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-18 09:37:54,555 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-18 09:37:54,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:57,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:57,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:57,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:57,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:57,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:57,944 INFO 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-02-18 09:37:57,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:37:57,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:37:57,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:37:57,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:58,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:01,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:01,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-18 09:38:01,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:01,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 09:38:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 09:38:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:38:01,849 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-18 09:38:17,994 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-18 09:38:18,633 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-18 09:38:19,242 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 09:38:19,683 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-18 09:38:20,129 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-18 09:38:20,575 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 09:38:20,995 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 09:38:21,415 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 09:38:21,818 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 09:38:22,214 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 09:38:22,593 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 09:38:22,960 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:38:23,323 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:38:23,685 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:38:24,032 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:38:24,366 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:38:24,694 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:38:25,007 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:38:25,309 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:38:25,609 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:38:25,890 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:38:26,461 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-18 09:38:26,812 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-18 09:38:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:29,154 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-18 09:38:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-18 09:38:29,154 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-18 09:38:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:29,155 INFO L225 Difference]: With dead ends: 574 [2019-02-18 09:38:29,156 INFO L226 Difference]: Without dead ends: 424 [2019-02-18 09:38:29,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-18 09:38:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-18 09:38:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-18 09:38:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-18 09:38:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-18 09:38:29,240 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-18 09:38:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:29,240 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-18 09:38:29,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 09:38:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-18 09:38:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-18 09:38:29,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:29,241 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-18 09:38:29,242 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-18 09:38:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:29,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:29,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:31,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:31,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:31,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:31,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:38:31,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:31,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:33,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:35,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-18 09:38:35,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:35,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 09:38:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 09:38:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:38:35,571 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-18 09:38:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,993 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-18 09:38:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:38:38,993 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-18 09:38:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,994 INFO L225 Difference]: With dead ends: 585 [2019-02-18 09:38:38,994 INFO L226 Difference]: Without dead ends: 278 [2019-02-18 09:38:38,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:38:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-18 09:38:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-18 09:38:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-18 09:38:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-18 09:38:39,075 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-18 09:38:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:39,075 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-18 09:38:39,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 09:38:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-18 09:38:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-18 09:38:39,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:39,076 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-18 09:38:39,077 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-18 09:38:39,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:39,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:42,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:42,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,670 INFO 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-02-18 09:38:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:42,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:42,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 09:38:42,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:42,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-02-18 09:39:00,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:00,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-02-18 09:39:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-02-18 09:39:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 09:39:00,773 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.