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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:52:39,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:52:39,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:52:39,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:52:39,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:52:39,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:52:39,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:52:39,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:52:39,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:52:39,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:52:39,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:52:39,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:52:39,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:52:39,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:52:39,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:52:39,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:52:39,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:52:39,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:52:39,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:52:39,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:52:39,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:52:39,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:52:39,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:52:39,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:52:39,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:52:39,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:52:39,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:52:39,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:52:39,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:52:39,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:52:39,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:52:39,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:52:39,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:52:39,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:52:39,819 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:52:39,820 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:52:39,820 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:52:39,833 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:52:39,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:52:39,835 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:52:39,835 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:52:39,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:52:39,835 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:52:39,835 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:52:39,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:52:39,836 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:52:39,836 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:52:39,836 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:52:39,837 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:52:39,837 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:52:39,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:52:39,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:52:39,838 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:52:39,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:52:39,838 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:52:39,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:52:39,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:52:39,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:52:39,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:52:39,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:52:39,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:52:39,840 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:52:39,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:52:39,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:52:39,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:52:39,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:52:39,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:52:39,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:52:39,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:52:39,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:52:39,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:52:39,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:52:39,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:52:39,906 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:52:39,907 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:52:39,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-18 09:52:39,908 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-18 09:52:39,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:52:39,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:52:39,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:52:39,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:52:39,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:52:39,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:52:40,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:40,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:52:40,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:52:40,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:52:40,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:52:40,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (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:52:40,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:52:40,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:52:40,366 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:52:40,367 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-18 09:52:40,369 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40 BoogieIcfgContainer [2019-02-18 09:52:40,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:52:40,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:52:40,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:52:40,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:52:40,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/2) ... [2019-02-18 09:52:40,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1ed23a and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:52:40, skipping insertion in model container [2019-02-18 09:52:40,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40" (2/2) ... [2019-02-18 09:52:40,379 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-18 09:52:40,390 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:52:40,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:52:40,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:52:40,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:52:40,453 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:52:40,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:52:40,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:52:40,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:52:40,454 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:52:40,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:52:40,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:52:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-18 09:52:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:52:40,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:52:40,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-18 09:52:40,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,635 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:52:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:52:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:52:40,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:52:40,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:52:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:52:40,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,657 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-18 09:52:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:40,774 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 09:52:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:52:40,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:52:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:40,799 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:52:40,799 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:52:40,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:52:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-18 09:52:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:52:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-18 09:52:40,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-18 09:52:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:40,870 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-18 09:52:40,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:52:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-18 09:52:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:52:40,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:52:40,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-18 09:52:40,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:40,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:40,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:40,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:52:40,965 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-18 09:52:41,026 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:52:41,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:52:42,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:52:42,721 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:52:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:42,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:52:42,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:42,731 INFO 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:52:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:42,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:42,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:42,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:42,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:42,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-18 09:52:42,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:42,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:52:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:52:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:42,984 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-18 09:52:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:43,038 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-18 09:52:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:52:43,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:52:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:43,040 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:52:43,040 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:52:43,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:52:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 09:52:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:52:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-18 09:52:43,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-18 09:52:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:43,044 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-18 09:52:43,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:52:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-18 09:52:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:52:43,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:43,046 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-18 09:52:43,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-18 09:52:43,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:43,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,171 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:52:43,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,171 INFO 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:52:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:43,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:43,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:52:43,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:43,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:43,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-18 09:52:43,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:43,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:52:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:52:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:43,370 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-18 09:52:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:43,448 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-18 09:52:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:52:43,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 09:52:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:43,450 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:52:43,450 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:52:43,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:52:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:52:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:52:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-18 09:52:43,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-18 09:52:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:43,454 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-18 09:52:43,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:52:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-18 09:52:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:52:43,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:43,455 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-18 09:52:43,455 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-18 09:52:43,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:43,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:43,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,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:52:43,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,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 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:52:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:43,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:43,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:43,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:43,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:43,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:43,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:43,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-18 09:52:43,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:43,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:52:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:52:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:43,782 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-18 09:52:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:44,027 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-18 09:52:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:52:44,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-18 09:52:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:44,028 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:52:44,029 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:52:44,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:52:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 09:52:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:52:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-18 09:52:44,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-18 09:52:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:44,033 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-18 09:52:44,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:52:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-18 09:52:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:52:44,034 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:44,034 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-18 09:52:44,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-18 09:52:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:44,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:44,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:44,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:52:44,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,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 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:52:44,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:44,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:44,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:44,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:44,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:44,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-18 09:52:44,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:44,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:52:44,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:52:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:52:44,974 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-18 09:52:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:45,081 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-18 09:52:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:52:45,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-18 09:52:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:45,083 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:52:45,083 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:52:45,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:52:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:52:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 09:52:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:52:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-18 09:52:45,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-18 09:52:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:45,092 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-18 09:52:45,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:52:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-18 09:52:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-18 09:52:45,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:45,093 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-18 09:52:45,093 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-18 09:52:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:45,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:45,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:45,400 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:52:45,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,401 INFO 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:52:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:45,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:45,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:52:45,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:45,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:45,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:45,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:45,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-18 09:52:45,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:45,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:52:45,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:52:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:45,617 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-18 09:52:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:45,682 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-18 09:52:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:52:45,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-18 09:52:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:45,684 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:52:45,684 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:52:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:52:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:52:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:52:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-18 09:52:45,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-18 09:52:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:45,689 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-18 09:52:45,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:52:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-18 09:52:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:52:45,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:45,690 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-18 09:52:45,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-18 09:52:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:45,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:45,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:45,802 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:52:45,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:45,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:45,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:45,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:45,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:45,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:45,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-18 09:52:46,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:52:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:52:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:46,164 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-18 09:52:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,236 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-18 09:52:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:52:46,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-18 09:52:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,237 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:52:46,237 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:52:46,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:52:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 09:52:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:52:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-18 09:52:46,243 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-18 09:52:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,243 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-18 09:52:46,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:52:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-18 09:52:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-18 09:52:46,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,244 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-18 09:52:46,244 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-18 09:52:46,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:46,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:46,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,405 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:52:46,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,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 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:52:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:46,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:46,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:46,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-18 09:52:46,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:52:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:52:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:46,880 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-18 09:52:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,928 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-18 09:52:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:52:46,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-18 09:52:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,933 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:52:46,933 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:52:46,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:52:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-18 09:52:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:52:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-18 09:52:46,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-18 09:52:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,937 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-18 09:52:46,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:52:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-18 09:52:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:52:46,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,937 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-18 09:52:46,938 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-18 09:52:46,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:46,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:47,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,077 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:52:47,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,078 INFO 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:52:47,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:47,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:47,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-18 09:52:47,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:47,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:47,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:47,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-18 09:52:47,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:47,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:52:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:52:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:47,354 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-18 09:52:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,554 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-18 09:52:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:52:47,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-18 09:52:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,555 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:52:47,555 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:52:47,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:52:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 09:52:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:52:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-18 09:52:47,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-18 09:52:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,563 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-18 09:52:47,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:52:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-18 09:52:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-18 09:52:47,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,564 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-18 09:52:47,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-18 09:52:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:47,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,750 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:52:47,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,751 INFO 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:52:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:47,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:47,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:47,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:47,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:47,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:48,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:48,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-18 09:52:48,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:48,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:52:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:52:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:48,194 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-18 09:52:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:48,254 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-18 09:52:48,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:52:48,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-18 09:52:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:48,256 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:52:48,256 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:52:48,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:52:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-18 09:52:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:52:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-18 09:52:48,261 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-18 09:52:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-18 09:52:48,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:52:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-18 09:52:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:52:48,262 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:48,262 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-18 09:52:48,263 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-18 09:52:48,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:48,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:48,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:48,414 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:52:48,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:48,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:48,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:48,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:48,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-18 09:52:48,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:48,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:52:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:52:48,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:48,948 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-18 09:52:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,003 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-18 09:52:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:52:49,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-18 09:52:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,006 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:52:49,006 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:52:49,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:52:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 09:52:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:52:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-18 09:52:49,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-18 09:52:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,011 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-18 09:52:49,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:52:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-18 09:52:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-18 09:52:49,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,012 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-18 09:52:49,012 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-18 09:52:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:49,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:49,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:49,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:52:49,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,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 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:52:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:49,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:49,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-18 09:52:49,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:49,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:49,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-18 09:52:49,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:52:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:52:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:52:49,567 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-18 09:52:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,635 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-18 09:52:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:52:49,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-18 09:52:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,637 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:52:49,637 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:52:49,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:52:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:52:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-18 09:52:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:52:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-18 09:52:49,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-18 09:52:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,643 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-18 09:52:49,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:52:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-18 09:52:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:52:49,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,644 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-18 09:52:49,644 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-18 09:52:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:49,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:49,823 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:52:49,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,823 INFO 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:52:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:49,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:49,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:49,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:49,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:49,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:50,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-18 09:52:50,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:52:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:52:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:50,109 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-18 09:52:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:50,171 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-18 09:52:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:52:50,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-18 09:52:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:50,173 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:52:50,173 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:52:50,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:52:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:52:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:52:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-18 09:52:50,179 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-18 09:52:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:50,179 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-18 09:52:50,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:52:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-18 09:52:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:52:50,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:50,180 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-18 09:52:50,181 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-18 09:52:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:50,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:50,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:50,401 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:52:50,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:50,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:50,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:50,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-18 09:52:50,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:52:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:52:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:50,796 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-18 09:52:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:50,862 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-18 09:52:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:52:50,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-18 09:52:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:50,863 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:52:50,863 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:52:50,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:52:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-18 09:52:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:52:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-18 09:52:50,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-18 09:52:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:50,870 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-18 09:52:50,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:52:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-18 09:52:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:52:50,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:50,872 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-18 09:52:50,872 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-18 09:52:50,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:52:51,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:51,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:51,064 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:52:51,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,064 INFO 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:52:51,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:51,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:51,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:52:51,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:51,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:52:51,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:52:51,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:51,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-18 09:52:51,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:51,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:52:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:52:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:52:51,492 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-18 09:52:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:51,564 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-18 09:52:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:52:51,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-18 09:52:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:51,566 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:52:51,566 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:52:51,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:52:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:52:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-18 09:52:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:52:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-18 09:52:51,571 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-18 09:52:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:51,571 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-18 09:52:51,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:52:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-18 09:52:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:52:51,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:51,572 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-18 09:52:51,573 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-18 09:52:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:52:52,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:52,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:52,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:52,063 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:52:52,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:52,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:52,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:52,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:52,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:52,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:52,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:52:52,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:52:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:52,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-18 09:52:52,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:52,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:52:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:52:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:52,497 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-18 09:52:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:52,615 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-18 09:52:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:52:52,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-18 09:52:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:52,616 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:52:52,616 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:52:52,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:52:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-18 09:52:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:52:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-18 09:52:52,621 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-18 09:52:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:52,621 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-18 09:52:52,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:52:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-18 09:52:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:52:52,622 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:52,623 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-18 09:52:52,623 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-18 09:52:52,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:52:53,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:53,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:53,243 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:52:53,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,243 INFO 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:52:53,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:53,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:53,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:52:53,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:52:53,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:53,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-18 09:52:53,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:53,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:52:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:52:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:52:53,971 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-18 09:52:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:54,036 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-18 09:52:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:52:54,037 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-18 09:52:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:54,038 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:52:54,038 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:52:54,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:52:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:52:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-18 09:52:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:52:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-18 09:52:54,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-18 09:52:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:54,044 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-18 09:52:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:52:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-18 09:52:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-18 09:52:54,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:54,046 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-18 09:52:54,046 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-18 09:52:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:54,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:52:54,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:54,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:54,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:54,990 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:52:54,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:54,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 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:52:55,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:55,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:55,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-18 09:52:55,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:55,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:52:55,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:52:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-18 09:52:55,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:55,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:52:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:52:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:52:55,891 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-18 09:52:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:55,962 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-18 09:52:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:52:55,963 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-18 09:52:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:55,964 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:52:55,964 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:52:55,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:52:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:52:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-18 09:52:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:52:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-18 09:52:55,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-18 09:52:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:55,970 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-18 09:52:55,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:52:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-18 09:52:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:52:55,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:55,971 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-18 09:52:55,971 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-18 09:52:55,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:55,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:55,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:52:56,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:56,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:56,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:56,655 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:52:56,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:56,655 INFO 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:52:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:56,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:56,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:56,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:56,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:52:56,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:52:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-18 09:52:57,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:57,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:52:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:52:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:57,454 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-18 09:52:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:57,698 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-18 09:52:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:52:57,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-18 09:52:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:57,699 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:52:57,699 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:52:57,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:52:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-18 09:52:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:52:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-18 09:52:57,706 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-18 09:52:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:57,706 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-18 09:52:57,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:52:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-18 09:52:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-18 09:52:57,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:57,709 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-18 09:52:57,709 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-18 09:52:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:57,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:57,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:52:58,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:58,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:58,604 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:52:58,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,604 INFO 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:52:58,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:58,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:58,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:52:58,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:52:59,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:59,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-18 09:52:59,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:59,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:52:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:52:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:52:59,343 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-18 09:52:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:59,410 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-18 09:52:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:52:59,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-18 09:52:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:59,411 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:52:59,412 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:52:59,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:52:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:52:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-18 09:52:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:52:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-18 09:52:59,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-18 09:52:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:59,417 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-18 09:52:59,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:52:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-18 09:52:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:52:59,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:59,418 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-18 09:52:59,418 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-18 09:52:59,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:52:59,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:59,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:59,770 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:52:59,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,770 INFO 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:52:59,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:59,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:59,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:52:59,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:59,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:52:59,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:53:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-18 09:53:00,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:53:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:53:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:53:00,349 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-18 09:53:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:00,421 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-18 09:53:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:53:00,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-18 09:53:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:00,422 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:53:00,422 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:53:00,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:53:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:53:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-18 09:53:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:53:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-18 09:53:00,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-18 09:53:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:00,431 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-18 09:53:00,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:53:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-18 09:53:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-18 09:53:00,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:00,432 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-18 09:53:00,432 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-18 09:53:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:00,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:00,760 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:53:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,760 INFO 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:53:00,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:00,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:00,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:00,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:00,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:00,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:01,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:01,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-18 09:53:01,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:01,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:53:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:53:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:53:01,468 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-18 09:53:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:01,562 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-18 09:53:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:53:01,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-18 09:53:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:01,566 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:53:01,566 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:53:01,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:53:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:53:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-18 09:53:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:53:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-18 09:53:01,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-18 09:53:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:01,571 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-18 09:53:01,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:53:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-18 09:53:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:53:01,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:01,572 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-18 09:53:01,572 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-18 09:53:01,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:01,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:01,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:01,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:02,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:02,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:02,333 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:53:02,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,333 INFO 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:53:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:02,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:02,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:03,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:03,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-18 09:53:03,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:03,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:53:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:53:03,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:53:03,211 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-18 09:53:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:03,331 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-18 09:53:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:53:03,333 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-18 09:53:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:03,334 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:53:03,334 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:53:03,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:53:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:53:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-18 09:53:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:53:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-18 09:53:03,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-18 09:53:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:03,338 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-18 09:53:03,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:53:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-18 09:53:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:53:03,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:03,339 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-18 09:53:03,340 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-18 09:53:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:03,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:03,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:03,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:03,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:03,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:03,710 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:53:03,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:03,710 INFO 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:53:03,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:03,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:03,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:53:03,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:03,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:03,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:04,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:04,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-18 09:53:04,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:04,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:53:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:53:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:04,457 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-18 09:53:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:04,552 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-18 09:53:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:53:04,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-18 09:53:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:04,554 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:53:04,554 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:53:04,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:53:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-18 09:53:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:53:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-18 09:53:04,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-18 09:53:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:04,558 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-18 09:53:04,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:53:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-18 09:53:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:53:04,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:04,559 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-18 09:53:04,559 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-18 09:53:04,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:04,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:04,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:04,916 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:53:04,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:04,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:04,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:04,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:04,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:04,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:04,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:06,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:06,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-18 09:53:06,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:06,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:53:06,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:53:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:06,161 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-18 09:53:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:06,265 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-18 09:53:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:53:06,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-18 09:53:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:06,267 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:53:06,267 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:53:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:53:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-18 09:53:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:53:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-18 09:53:06,271 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-18 09:53:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:06,272 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-18 09:53:06,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:53:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-18 09:53:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-18 09:53:06,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:06,273 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-18 09:53:06,273 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-18 09:53:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:06,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:06,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:06,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:06,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:06,965 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:53:06,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,965 INFO 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:53:06,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:06,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:07,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:07,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:08,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:08,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-18 09:53:08,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:08,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:53:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:53:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:08,058 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-18 09:53:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:08,261 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-18 09:53:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:53:08,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-18 09:53:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:08,262 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:53:08,262 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:53:08,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:53:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-18 09:53:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:53:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-18 09:53:08,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-18 09:53:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:08,267 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-18 09:53:08,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:53:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-18 09:53:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:53:08,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:08,267 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-18 09:53:08,268 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-18 09:53:08,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:08,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:08,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:08,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:08,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:08,798 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:53:08,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:08,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:08,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-18 09:53:08,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:08,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:08,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:10,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:10,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-18 09:53:10,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:10,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:53:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:53:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:10,099 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-18 09:53:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:10,216 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-18 09:53:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:53:10,216 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-18 09:53:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:10,217 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:53:10,217 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:53:10,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:53:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-18 09:53:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:53:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-18 09:53:10,222 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-18 09:53:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-18 09:53:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:53:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-18 09:53:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:53:10,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:10,224 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-18 09:53:10,224 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-18 09:53:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:10,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:10,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:10,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:10,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:10,845 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:53:10,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:10,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:10,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:10,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:10,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:10,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:11,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:11,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-18 09:53:11,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:11,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:53:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:53:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:11,772 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-18 09:53:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:11,900 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-18 09:53:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:53:11,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-18 09:53:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:11,901 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:53:11,901 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:53:11,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:53:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-18 09:53:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:53:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-18 09:53:11,905 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-18 09:53:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:11,905 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-18 09:53:11,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:53:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-18 09:53:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:53:11,906 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:11,906 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-18 09:53:11,906 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-18 09:53:11,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:12,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:12,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:12,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:12,459 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:53:12,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:12,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:12,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:12,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:12,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:12,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:13,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:13,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-18 09:53:13,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:13,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:53:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:53:13,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:13,719 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-18 09:53:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:13,842 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-18 09:53:13,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:53:13,842 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-18 09:53:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:13,843 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:53:13,843 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:53:13,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:53:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-18 09:53:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:53:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-18 09:53:13,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-18 09:53:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-18 09:53:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:53:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-18 09:53:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:53:13,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:13,849 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-18 09:53:13,850 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-18 09:53:13,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:13,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:14,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:14,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:14,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:14,291 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:53:14,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:14,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:14,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:14,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:53:14,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:14,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:14,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:15,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:15,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-18 09:53:15,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:15,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:53:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:53:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:15,434 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-18 09:53:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:15,547 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-18 09:53:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:53:15,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-18 09:53:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:15,549 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:53:15,549 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:53:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:53:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-18 09:53:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:53:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-18 09:53:15,553 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-18 09:53:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-18 09:53:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:53:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-18 09:53:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:53:15,554 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:15,554 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-18 09:53:15,555 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-18 09:53:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:15,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:15,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:16,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:16,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:16,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:16,096 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:53:16,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:16,096 INFO 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:53:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:16,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:16,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:16,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:16,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:16,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:17,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:17,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-18 09:53:17,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:17,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:53:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:53:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:17,563 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-18 09:53:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:17,734 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-18 09:53:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:53:17,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-18 09:53:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:17,736 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:53:17,736 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:53:17,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:53:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-18 09:53:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:53:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-18 09:53:17,741 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-18 09:53:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:17,742 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-18 09:53:17,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:53:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-18 09:53:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-18 09:53:17,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:17,743 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-18 09:53:17,743 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-18 09:53:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:17,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:17,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:18,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:18,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:18,382 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:53:18,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:18,382 INFO 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:53:18,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:18,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:18,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:18,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:19,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:19,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-18 09:53:19,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:19,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:53:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:53:19,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:19,586 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-18 09:53:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:19,712 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-18 09:53:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:53:19,713 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-18 09:53:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:19,714 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:53:19,714 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:53:19,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:53:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-18 09:53:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:53:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-18 09:53:19,718 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-18 09:53:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:19,719 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-18 09:53:19,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:53:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-18 09:53:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:53:19,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:19,719 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-18 09:53:19,720 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-18 09:53:19,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:19,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:19,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:19,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:19,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:20,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:20,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:20,780 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:53:20,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,780 INFO 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:53:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:20,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:20,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-18 09:53:20,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:20,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:20,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:22,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:22,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-18 09:53:22,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:22,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:53:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:53:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:22,163 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-18 09:53:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:22,312 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-18 09:53:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:53:22,313 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-18 09:53:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:22,314 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:53:22,314 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:53:22,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:53:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-18 09:53:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:53:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-18 09:53:22,318 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-18 09:53:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:22,318 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-18 09:53:22,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:53:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-18 09:53:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:53:22,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:22,319 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-18 09:53:22,319 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-18 09:53:22,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:22,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:22,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:22,916 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:53:22,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:22,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:22,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:22,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:22,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:22,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:24,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:24,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-18 09:53:24,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:24,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:53:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:53:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:24,235 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-18 09:53:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:24,406 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-18 09:53:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:53:24,406 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-18 09:53:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:24,407 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:53:24,408 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:53:24,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:53:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-18 09:53:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:53:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-18 09:53:24,411 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-18 09:53:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:24,411 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-18 09:53:24,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:53:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-18 09:53:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:53:24,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:24,412 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-18 09:53:24,412 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-18 09:53:24,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:25,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:25,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:25,076 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:53:25,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:25,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:25,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:25,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:25,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:26,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:26,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-18 09:53:26,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:26,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:53:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:53:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:26,670 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-18 09:53:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:26,858 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-18 09:53:26,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:53:26,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-18 09:53:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:26,859 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:53:26,859 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:53:26,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:53:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-18 09:53:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:53:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-18 09:53:26,863 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-18 09:53:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:26,863 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-18 09:53:26,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:53:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-18 09:53:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-18 09:53:26,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:26,864 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-18 09:53:26,864 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-18 09:53:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:28,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:28,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:28,005 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:53:28,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:28,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:28,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-18 09:53:28,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:28,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:28,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:29,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:29,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-18 09:53:29,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:29,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:53:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:53:29,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:53:29,805 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-18 09:53:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:29,940 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-18 09:53:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:53:29,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-18 09:53:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:29,941 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:53:29,941 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:53:29,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:53:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:53:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-18 09:53:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:53:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-18 09:53:29,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-18 09:53:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:29,945 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-18 09:53:29,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:53:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-18 09:53:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:53:29,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:29,945 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-18 09:53:29,946 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-18 09:53:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:30,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:30,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:30,598 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:53:30,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,598 INFO 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:53:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:30,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:30,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:30,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:30,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:30,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:32,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:32,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-18 09:53:32,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:32,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:53:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:53:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:32,160 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-18 09:53:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:32,314 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-18 09:53:32,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:53:32,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-18 09:53:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:32,315 INFO L225 Difference]: With dead ends: 118 [2019-02-18 09:53:32,315 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:53:32,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:53:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-18 09:53:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:53:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-18 09:53:32,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-18 09:53:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:32,318 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-18 09:53:32,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:53:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-18 09:53:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-18 09:53:32,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:32,319 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-18 09:53:32,319 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-18 09:53:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:32,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:32,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:32,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:32,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:33,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:33,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:33,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:53:33,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,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 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:53:33,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:33,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:33,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:35,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:35,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-18 09:53:35,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:35,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:53:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:53:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:35,096 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-18 09:53:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:35,252 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-18 09:53:35,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:53:35,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-18 09:53:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:35,253 INFO L225 Difference]: With dead ends: 121 [2019-02-18 09:53:35,253 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:53:35,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:53:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-18 09:53:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:53:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-18 09:53:35,256 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-18 09:53:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:35,256 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-18 09:53:35,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:53:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-18 09:53:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:53:35,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:35,257 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-18 09:53:35,257 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-18 09:53:35,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:35,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:35,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:35,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:35,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:35,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:35,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:35,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:35,961 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:53:35,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:35,961 INFO 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:53:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:35,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:36,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:53:36,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:36,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:36,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:38,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:38,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-18 09:53:38,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:38,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:53:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:53:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:38,402 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-18 09:53:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:38,565 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-18 09:53:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:53:38,565 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-18 09:53:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:38,566 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:53:38,566 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:53:38,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:53:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-18 09:53:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-18 09:53:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-18 09:53:38,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-18 09:53:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:38,569 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-18 09:53:38,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:53:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-18 09:53:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-18 09:53:38,570 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:38,570 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-18 09:53:38,570 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-18 09:53:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:38,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:38,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:39,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:39,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:39,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:39,373 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:53:39,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:39,374 INFO 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:53:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:39,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:39,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:39,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:39,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:39,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:41,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:41,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-18 09:53:41,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:41,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:53:41,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:53:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:41,218 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-18 09:53:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:41,371 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-18 09:53:41,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:53:41,372 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-18 09:53:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:41,372 INFO L225 Difference]: With dead ends: 127 [2019-02-18 09:53:41,372 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:53:41,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:53:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-18 09:53:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:53:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-18 09:53:41,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-18 09:53:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:41,375 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-18 09:53:41,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:53:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-18 09:53:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:53:41,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:41,376 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-18 09:53:41,376 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-18 09:53:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:42,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:42,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:42,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:42,161 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:53:42,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:42,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:42,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:42,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:42,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:44,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:44,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-18 09:53:44,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:44,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:53:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:53:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:44,137 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-18 09:53:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:44,305 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-18 09:53:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:53:44,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-18 09:53:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:44,306 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:53:44,306 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:53:44,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:53:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-18 09:53:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:53:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-18 09:53:44,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-18 09:53:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:44,310 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-18 09:53:44,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:53:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-18 09:53:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:53:44,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:44,311 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-18 09:53:44,311 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-18 09:53:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:44,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:45,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:45,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:45,945 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:53:45,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,945 INFO 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:53:45,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:45,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:46,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:53:46,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:46,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:46,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:48,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:48,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-18 09:53:48,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:48,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:53:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:53:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:48,532 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-18 09:53:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:48,701 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-18 09:53:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:53:48,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-18 09:53:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:48,702 INFO L225 Difference]: With dead ends: 133 [2019-02-18 09:53:48,702 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:53:48,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:53:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-18 09:53:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:53:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-18 09:53:48,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-18 09:53:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:48,706 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-18 09:53:48,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:53:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-18 09:53:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:53:48,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:48,706 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-18 09:53:48,707 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-18 09:53:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:48,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:48,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:53:50,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:50,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:50,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:50,574 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:53:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:50,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:50,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:50,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:50,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:50,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:53:50,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:53:52,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:52,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-18 09:53:52,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:52,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:53:52,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:53:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:53:52,722 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-18 09:53:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:52,900 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-18 09:53:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:53:52,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-18 09:53:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:52,902 INFO L225 Difference]: With dead ends: 136 [2019-02-18 09:53:52,902 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:53:52,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:53:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:53:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-18 09:53:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:53:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-18 09:53:52,907 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-18 09:53:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:52,907 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-18 09:53:52,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:53:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-18 09:53:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:53:52,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:52,908 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-18 09:53:52,908 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-18 09:53:52,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:52,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:52,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:52,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:52,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:53:54,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:54,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:54,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:54,107 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:53:54,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:54,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:54,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:54,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:53:54,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:53:56,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:56,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-18 09:53:56,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:56,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:53:56,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:53:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:53:56,215 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-18 09:53:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:56,495 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-18 09:53:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:53:56,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-18 09:53:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:56,497 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:53:56,497 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:53:56,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:53:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:53:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-18 09:53:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:53:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-18 09:53:56,501 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-18 09:53:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:56,501 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-18 09:53:56,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:53:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-18 09:53:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:53:56,502 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:56,502 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-18 09:53:56,502 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-18 09:53:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:56,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:56,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:53:59,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:59,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:59,164 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:53:59,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:59,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:59,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:59,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-18 09:53:59,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:59,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:53:59,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:54:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:01,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-18 09:54:01,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:01,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:54:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:54:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:54:01,676 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-18 09:54:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:03,446 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-18 09:54:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:54:03,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-18 09:54:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:03,447 INFO L225 Difference]: With dead ends: 142 [2019-02-18 09:54:03,447 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:54:03,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:54:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:54:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-18 09:54:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:54:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-18 09:54:03,452 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-18 09:54:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:03,452 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-18 09:54:03,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:54:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-18 09:54:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-18 09:54:03,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:03,453 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-18 09:54:03,453 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-18 09:54:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:03,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:03,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:05,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:05,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:05,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:05,075 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:54:05,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:05,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:05,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:05,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:05,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:05,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:05,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:05,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:07,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-18 09:54:07,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:07,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:54:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:54:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:07,885 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-18 09:54:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:08,159 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-18 09:54:08,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:54:08,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-18 09:54:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:08,161 INFO L225 Difference]: With dead ends: 145 [2019-02-18 09:54:08,161 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:54:08,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:54:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-18 09:54:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:54:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-18 09:54:08,165 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-18 09:54:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:08,165 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-18 09:54:08,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:54:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-18 09:54:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:54:08,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:08,166 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-18 09:54:08,168 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-18 09:54:08,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:08,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:08,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:09,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:09,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:09,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:09,300 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:54:09,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:09,300 INFO 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:54:09,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:09,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:09,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:11,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-18 09:54:11,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:11,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:54:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:54:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:54:11,913 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-18 09:54:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:12,090 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-18 09:54:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:54:12,090 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-18 09:54:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:12,091 INFO L225 Difference]: With dead ends: 148 [2019-02-18 09:54:12,092 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:54:12,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:54:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:54:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-18 09:54:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-18 09:54:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-18 09:54:12,096 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-18 09:54:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:12,096 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-18 09:54:12,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:54:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-18 09:54:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-18 09:54:12,096 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:12,096 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-18 09:54:12,097 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-18 09:54:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:12,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:13,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:13,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:13,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:13,040 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:54:13,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:13,041 INFO 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:54:13,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:13,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:13,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:54:13,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:13,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:13,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:16,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:16,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-18 09:54:16,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:16,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:54:16,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:54:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:16,503 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-18 09:54:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:16,712 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-18 09:54:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:54:16,712 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-18 09:54:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:16,713 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:54:16,713 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:54:16,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:54:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-18 09:54:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:54:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-18 09:54:16,717 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-18 09:54:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:16,718 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-18 09:54:16,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:54:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-18 09:54:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:54:16,718 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:16,718 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-18 09:54:16,719 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-18 09:54:16,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:16,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:16,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:17,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:17,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:17,761 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:54:17,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,762 INFO 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:54:17,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:17,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:17,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:17,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:17,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:17,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:20,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-18 09:54:20,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:20,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:54:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:54:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:20,596 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-18 09:54:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:20,860 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-18 09:54:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:54:20,860 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-18 09:54:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:20,861 INFO L225 Difference]: With dead ends: 154 [2019-02-18 09:54:20,861 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:54:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:54:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-18 09:54:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:54:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-18 09:54:20,865 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-18 09:54:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:20,866 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-18 09:54:20,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:54:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-18 09:54:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-18 09:54:20,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:20,867 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-18 09:54:20,867 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-18 09:54:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:20,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:20,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:22,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:22,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:22,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:22,490 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:54:22,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:22,490 INFO 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:54:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:22,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:22,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:22,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:25,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-18 09:54:25,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:25,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:54:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:54:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:54:25,526 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-18 09:54:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:25,788 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-18 09:54:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:54:25,788 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-18 09:54:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:25,789 INFO L225 Difference]: With dead ends: 157 [2019-02-18 09:54:25,789 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:54:25,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:54:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:54:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-18 09:54:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:54:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-18 09:54:25,794 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-18 09:54:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:25,794 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-18 09:54:25,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:54:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-18 09:54:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:54:25,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:25,795 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-18 09:54:25,795 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-18 09:54:25,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:25,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:25,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:26,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:26,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:26,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:26,816 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:54:26,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:26,816 INFO 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:54:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:26,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:28,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-18 09:54:28,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:28,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:28,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:31,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:31,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-18 09:54:31,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:31,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:54:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:54:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:31,056 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-18 09:54:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:31,802 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-18 09:54:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:54:31,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-18 09:54:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:31,803 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:54:31,803 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:54:31,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:54:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-18 09:54:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-18 09:54:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-18 09:54:31,808 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-18 09:54:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:31,808 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-18 09:54:31,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:54:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-18 09:54:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-18 09:54:31,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:31,809 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-18 09:54:31,809 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-18 09:54:31,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:31,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:31,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:31,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:31,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:32,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:32,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:32,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:32,889 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:54:32,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:32,889 INFO 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:54:32,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:32,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:32,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:32,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:32,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:32,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:35,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:35,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-18 09:54:35,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:35,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:54:35,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:54:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:35,782 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-18 09:54:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:36,035 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-18 09:54:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:54:36,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-18 09:54:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:36,037 INFO L225 Difference]: With dead ends: 163 [2019-02-18 09:54:36,037 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:54:36,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:54:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-18 09:54:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:54:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-18 09:54:36,041 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-18 09:54:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:36,041 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-18 09:54:36,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:54:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-18 09:54:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:54:36,042 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:36,042 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-18 09:54:36,043 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-18 09:54:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:36,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:36,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:37,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:37,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:37,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:37,471 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:54:37,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:37,471 INFO 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:54:37,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:37,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:37,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:40,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:40,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-18 09:54:40,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:40,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:54:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:54:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:40,760 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-18 09:54:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:41,008 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-18 09:54:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:54:41,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-18 09:54:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:41,009 INFO L225 Difference]: With dead ends: 166 [2019-02-18 09:54:41,009 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:54:41,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:54:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-18 09:54:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:54:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-18 09:54:41,013 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-18 09:54:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:41,013 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-18 09:54:41,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:54:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-18 09:54:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 09:54:41,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:41,014 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-18 09:54:41,014 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-18 09:54:41,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:41,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:41,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:54:42,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:42,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:42,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:42,217 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:54:42,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:42,217 INFO 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:54:42,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:42,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:43,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-18 09:54:43,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:43,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:54:43,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:54:46,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:46,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-18 09:54:46,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:46,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:54:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:54:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:54:46,863 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-18 09:54:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:47,155 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-18 09:54:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:54:47,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-18 09:54:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:47,156 INFO L225 Difference]: With dead ends: 169 [2019-02-18 09:54:47,156 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:54:47,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:54:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:54:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-18 09:54:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:54:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-18 09:54:47,160 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-18 09:54:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:47,160 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-18 09:54:47,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:54:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-18 09:54:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 09:54:47,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:47,161 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-18 09:54:47,161 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-18 09:54:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:47,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:47,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:54:48,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:48,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:48,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:48,675 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:54:48,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:48,675 INFO 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:54:48,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:48,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:48,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:48,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:48,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:54:48,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:54:52,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:52,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-18 09:54:52,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:52,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:54:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:54:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:54:52,102 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-18 09:54:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:52,344 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-18 09:54:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:54:52,344 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-18 09:54:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:52,345 INFO L225 Difference]: With dead ends: 172 [2019-02-18 09:54:52,346 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:54:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:54:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:54:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-18 09:54:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 09:54:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-18 09:54:52,350 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-18 09:54:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:52,350 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-18 09:54:52,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:54:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-18 09:54:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 09:54:52,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:52,351 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-18 09:54:52,351 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-18 09:54:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:52,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:52,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:54:53,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:53,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:53,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:53,586 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:54:53,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:53,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:53,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:53,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:54:53,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:54:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-18 09:54:57,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:57,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:54:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:54:57,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:54:57,514 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-18 09:54:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:57,960 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-18 09:54:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:54:57,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-18 09:54:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:57,961 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:54:57,961 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:54:57,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:54:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:54:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-18 09:54:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:54:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-18 09:54:57,966 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-18 09:54:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:57,966 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-18 09:54:57,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:54:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-18 09:54:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-18 09:54:57,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:57,967 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-18 09:54:57,967 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-18 09:54:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:57,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:54:59,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:59,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:59,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:59,204 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:54:59,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:59,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:59,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:00,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:55:00,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:00,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:55:00,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:55:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:03,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-18 09:55:03,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:03,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:55:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:55:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:55:03,713 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-18 09:55:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:04,054 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-18 09:55:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:55:04,054 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-18 09:55:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:04,055 INFO L225 Difference]: With dead ends: 178 [2019-02-18 09:55:04,055 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:55:04,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:55:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:55:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-18 09:55:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-18 09:55:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-18 09:55:04,058 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-18 09:55:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:04,058 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-18 09:55:04,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:55:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-18 09:55:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-18 09:55:04,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:04,059 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-18 09:55:04,060 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-18 09:55:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:04,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:04,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:55:05,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:05,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:05,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:05,688 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:55:05,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:05,688 INFO 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:55:05,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:05,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:05,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:05,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:05,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:55:05,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:55:09,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-18 09:55:09,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:09,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:55:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:55:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:55:09,358 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-18 09:55:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:09,669 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-18 09:55:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:55:09,669 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-18 09:55:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:09,670 INFO L225 Difference]: With dead ends: 181 [2019-02-18 09:55:09,670 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 09:55:09,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:55:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 09:55:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-18 09:55:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:55:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-18 09:55:09,674 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-18 09:55:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:09,674 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-18 09:55:09,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:55:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-18 09:55:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-18 09:55:09,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:09,676 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-18 09:55:09,676 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-18 09:55:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:09,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:09,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:55:11,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:11,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:11,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:11,311 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:55:11,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:11,311 INFO 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:55:11,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:11,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:11,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:55:11,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:55:15,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:15,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-18 09:55:15,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:15,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:55:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:55:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:55:15,220 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-18 09:55:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:15,661 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-18 09:55:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:55:15,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-18 09:55:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:15,662 INFO L225 Difference]: With dead ends: 184 [2019-02-18 09:55:15,662 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 09:55:15,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:55:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 09:55:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-18 09:55:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-18 09:55:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-18 09:55:15,666 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-18 09:55:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:15,666 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-18 09:55:15,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:55:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-18 09:55:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-18 09:55:15,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:15,667 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-18 09:55:15,667 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-18 09:55:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:15,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:15,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:55:17,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:17,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:17,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:17,028 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:55:17,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:17,029 INFO 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:55:17,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:17,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:18,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-18 09:55:18,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:55:18,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:55:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:22,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-18 09:55:22,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:22,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:55:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:55:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:55:22,103 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-18 09:55:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:22,454 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-18 09:55:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:55:22,454 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-18 09:55:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:22,455 INFO L225 Difference]: With dead ends: 187 [2019-02-18 09:55:22,455 INFO L226 Difference]: Without dead ends: 125 [2019-02-18 09:55:22,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:55:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-18 09:55:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-18 09:55:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-18 09:55:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-18 09:55:22,460 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-18 09:55:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:22,460 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-18 09:55:22,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:55:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-18 09:55:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-18 09:55:22,461 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:22,461 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-18 09:55:22,461 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-18 09:55:22,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:22,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:22,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:22,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:55:23,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:23,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:23,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:23,870 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:55:23,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:23,870 INFO 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:55:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:23,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:23,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:23,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:23,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:55:23,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:55:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-18 09:55:28,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:55:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:55:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:55:28,104 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-18 09:55:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:28,398 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-18 09:55:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:55:28,398 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-18 09:55:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:28,399 INFO L225 Difference]: With dead ends: 190 [2019-02-18 09:55:28,399 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 09:55:28,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:55:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 09:55:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-18 09:55:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-18 09:55:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-18 09:55:28,403 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-18 09:55:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:28,404 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-18 09:55:28,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:55:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-18 09:55:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-18 09:55:28,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:28,405 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-18 09:55:28,405 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-18 09:55:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:28,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:28,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:55:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:29,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:29,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:29,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:55:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:29,841 INFO 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:55:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:29,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:29,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:55:29,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:55:34,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:34,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-18 09:55:34,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:34,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:55:34,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:55:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:55:34,238 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-18 09:55:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:34,632 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-18 09:55:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:55:34,632 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-18 09:55:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:34,633 INFO L225 Difference]: With dead ends: 193 [2019-02-18 09:55:34,633 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 09:55:34,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:55:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 09:55:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-18 09:55:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:55:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-18 09:55:34,638 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-18 09:55:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:34,638 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-18 09:55:34,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:55:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-18 09:55:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:55:34,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:34,639 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-18 09:55:34,639 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-18 09:55:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:34,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:55:36,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:36,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:36,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:36,391 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:55:36,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:36,391 INFO 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:55:36,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:36,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:37,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:55:37,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:37,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:55:37,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:55:41,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:41,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-18 09:55:41,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:41,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:55:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:55:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:55:41,902 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-18 09:55:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:42,315 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-18 09:55:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:55:42,316 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-18 09:55:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:42,317 INFO L225 Difference]: With dead ends: 196 [2019-02-18 09:55:42,317 INFO L226 Difference]: Without dead ends: 131 [2019-02-18 09:55:42,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:55:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-18 09:55:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-18 09:55:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-18 09:55:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-18 09:55:42,321 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-18 09:55:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:42,321 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-18 09:55:42,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:55:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-18 09:55:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-18 09:55:42,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:42,322 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-18 09:55:42,322 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-18 09:55:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:42,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:42,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:55:43,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:43,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:43,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:43,855 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:55:43,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:43,855 INFO 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:55:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:43,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:43,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:43,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:43,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:55:43,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:55:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:48,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-18 09:55:48,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:48,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:55:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:55:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:55:48,561 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-18 09:55:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:49,009 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-18 09:55:49,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:55:49,010 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-18 09:55:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:49,010 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:55:49,011 INFO L226 Difference]: Without dead ends: 133 [2019-02-18 09:55:49,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:55:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-18 09:55:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-18 09:55:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:55:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-18 09:55:49,016 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-18 09:55:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:49,016 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-18 09:55:49,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:55:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-18 09:55:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:55:49,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:49,017 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-18 09:55:49,017 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-18 09:55:49,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:49,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:49,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:55:50,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:50,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:50,631 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:55:50,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,631 INFO 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:55:50,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:50,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:50,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:55:50,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:55:55,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:55,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-18 09:55:55,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:55,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:55:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:55:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:55:55,919 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-18 09:55:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:56,456 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-18 09:55:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:55:56,456 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-18 09:55:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:56,457 INFO L225 Difference]: With dead ends: 202 [2019-02-18 09:55:56,457 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:55:56,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:55:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:55:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-18 09:55:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-18 09:55:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-18 09:55:56,461 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-18 09:55:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:56,462 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-18 09:55:56,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:55:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-18 09:55:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-18 09:55:56,462 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:56,463 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-18 09:55:56,463 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-18 09:55:56,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:56,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:56,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:55:58,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:58,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:58,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:58,800 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:55:58,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:58,800 INFO 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:55:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:58,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:02,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 09:56:02,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:02,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:56:02,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:56:07,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:07,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-18 09:56:07,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:07,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:56:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:56:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:56:07,122 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-18 09:56:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:07,590 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-18 09:56:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:56:07,591 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-18 09:56:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:07,591 INFO L225 Difference]: With dead ends: 205 [2019-02-18 09:56:07,592 INFO L226 Difference]: Without dead ends: 137 [2019-02-18 09:56:07,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:56:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-18 09:56:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-18 09:56:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:56:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-18 09:56:07,597 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-18 09:56:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:07,597 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-18 09:56:07,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:56:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-18 09:56:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-18 09:56:07,598 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:07,598 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-18 09:56:07,599 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-18 09:56:07,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:07,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:07,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:56:09,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:09,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:09,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:09,199 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:56:09,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:09,200 INFO 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:56:09,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:09,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:09,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:09,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:09,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:56:09,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:56:14,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:14,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-18 09:56:14,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:14,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:56:14,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:56:14,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:56:14,396 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-18 09:56:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:14,906 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-18 09:56:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:56:14,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-18 09:56:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:14,907 INFO L225 Difference]: With dead ends: 208 [2019-02-18 09:56:14,907 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 09:56:14,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:56:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 09:56:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-18 09:56:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-18 09:56:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-18 09:56:14,910 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-18 09:56:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:14,910 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-18 09:56:14,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:56:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-18 09:56:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-18 09:56:14,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:14,911 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-18 09:56:14,911 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-18 09:56:14,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:14,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:14,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:56:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:17,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:17,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:17,034 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:56:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:17,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:17,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:56:17,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:56:22,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:22,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-18 09:56:22,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:22,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:56:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:56:22,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:56:22,284 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-18 09:56:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:22,815 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-18 09:56:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:56:22,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-18 09:56:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:22,816 INFO L225 Difference]: With dead ends: 211 [2019-02-18 09:56:22,816 INFO L226 Difference]: Without dead ends: 141 [2019-02-18 09:56:22,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:56:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-18 09:56:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-18 09:56:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:56:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-18 09:56:22,820 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-18 09:56:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:22,820 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-18 09:56:22,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:56:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-18 09:56:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-18 09:56:22,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:22,822 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-18 09:56:22,822 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-18 09:56:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:22,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:56:24,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:24,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:24,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:24,569 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:56:24,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:24,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:24,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:24,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:27,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-18 09:56:27,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:27,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:56:28,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:56:33,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:33,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-18 09:56:33,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:33,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:56:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:56:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:56:33,101 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-18 09:56:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:33,644 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-18 09:56:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:56:33,644 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-18 09:56:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:33,645 INFO L225 Difference]: With dead ends: 214 [2019-02-18 09:56:33,645 INFO L226 Difference]: Without dead ends: 143 [2019-02-18 09:56:33,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:56:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-18 09:56:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-18 09:56:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-18 09:56:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-18 09:56:33,649 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-18 09:56:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:33,649 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-18 09:56:33,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:56:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-18 09:56:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-18 09:56:33,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:33,650 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-18 09:56:33,650 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-18 09:56:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:33,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:33,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:56:35,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:35,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:35,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:35,412 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:56:35,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:35,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:35,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:35,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:35,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:35,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:35,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:56:35,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:56:40,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:40,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-18 09:56:40,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:40,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:56:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:56:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:56:40,837 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-18 09:56:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:41,394 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-18 09:56:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:56:41,394 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-18 09:56:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:41,395 INFO L225 Difference]: With dead ends: 217 [2019-02-18 09:56:41,395 INFO L226 Difference]: Without dead ends: 145 [2019-02-18 09:56:41,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:56:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-18 09:56:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-18 09:56:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-18 09:56:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-18 09:56:41,400 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-18 09:56:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:41,400 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-18 09:56:41,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:56:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-18 09:56:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-18 09:56:41,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:41,401 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-18 09:56:41,402 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-18 09:56:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:41,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:41,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:56:43,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:43,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:43,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:43,532 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:56:43,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:43,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:43,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:43,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:43,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:56:43,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:56:49,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:49,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-18 09:56:49,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:49,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:56:49,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:56:49,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:56:49,127 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-18 09:56:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:49,557 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-18 09:56:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 09:56:49,558 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-18 09:56:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:49,559 INFO L225 Difference]: With dead ends: 220 [2019-02-18 09:56:49,559 INFO L226 Difference]: Without dead ends: 147 [2019-02-18 09:56:49,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:56:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-18 09:56:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-18 09:56:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-18 09:56:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-18 09:56:49,563 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-18 09:56:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:49,564 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-18 09:56:49,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:56:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-18 09:56:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-18 09:56:49,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:49,565 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-18 09:56:49,565 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-18 09:56:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:49,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:49,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:56:51,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:51,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:51,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:51,778 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:56:51,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:51,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:51,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:54,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-18 09:56:54,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:54,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:56:54,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:57:00,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-18 09:57:00,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:00,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:57:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:57:00,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:57:00,209 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-18 09:57:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:00,806 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-18 09:57:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 09:57:00,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-18 09:57:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:00,807 INFO L225 Difference]: With dead ends: 223 [2019-02-18 09:57:00,807 INFO L226 Difference]: Without dead ends: 149 [2019-02-18 09:57:00,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:57:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-18 09:57:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-18 09:57:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:57:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-18 09:57:00,811 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-18 09:57:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:00,812 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-18 09:57:00,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:57:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-18 09:57:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-18 09:57:00,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:00,813 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-18 09:57:00,813 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-18 09:57:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:57:03,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:03,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:03,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:03,205 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:57:03,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:03,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:03,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:03,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:03,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:03,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:57:03,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:57:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-18 09:57:09,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:09,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:57:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:57:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:57:09,108 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-18 09:57:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:09,673 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-18 09:57:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:57:09,673 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-18 09:57:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:09,674 INFO L225 Difference]: With dead ends: 226 [2019-02-18 09:57:09,674 INFO L226 Difference]: Without dead ends: 151 [2019-02-18 09:57:09,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:57:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-18 09:57:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-18 09:57:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-18 09:57:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-18 09:57:09,679 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-18 09:57:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:09,679 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-18 09:57:09,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:57:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-18 09:57:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-18 09:57:09,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:09,680 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-18 09:57:09,680 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-18 09:57:09,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:09,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:09,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:57:11,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:11,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:11,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:11,683 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:57:11,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:11,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:11,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:11,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:57:11,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:57:17,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:17,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-18 09:57:17,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:17,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:57:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:57:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:57:17,936 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-18 09:57:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:18,603 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-18 09:57:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:57:18,603 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-18 09:57:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:18,604 INFO L225 Difference]: With dead ends: 229 [2019-02-18 09:57:18,604 INFO L226 Difference]: Without dead ends: 153 [2019-02-18 09:57:18,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:57:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-18 09:57:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-18 09:57:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-18 09:57:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-18 09:57:18,607 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-18 09:57:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:18,607 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-18 09:57:18,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:57:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-18 09:57:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-18 09:57:18,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:18,608 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-18 09:57:18,608 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-18 09:57:18,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:18,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:57:20,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:20,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:20,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:20,868 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:57:20,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:20,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:20,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:20,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:23,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 09:57:23,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:23,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:57:23,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:57:29,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:29,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-18 09:57:29,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:29,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:57:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:57:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:57:29,217 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-18 09:57:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:29,857 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-18 09:57:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 09:57:29,858 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-18 09:57:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:29,858 INFO L225 Difference]: With dead ends: 232 [2019-02-18 09:57:29,859 INFO L226 Difference]: Without dead ends: 155 [2019-02-18 09:57:29,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:57:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-18 09:57:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-18 09:57:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-18 09:57:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-18 09:57:29,862 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-18 09:57:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-18 09:57:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:57:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-18 09:57:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-18 09:57:29,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:29,863 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-18 09:57:29,863 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-18 09:57:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:29,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:57:31,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:31,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:31,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:31,947 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:57:31,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:31,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:31,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:31,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:32,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:32,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:32,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:57:32,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:57:38,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:38,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-18 09:57:38,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:38,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:57:38,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:57:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:57:38,240 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-18 09:57:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:38,965 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-18 09:57:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 09:57:38,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-18 09:57:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:38,966 INFO L225 Difference]: With dead ends: 235 [2019-02-18 09:57:38,966 INFO L226 Difference]: Without dead ends: 157 [2019-02-18 09:57:38,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:57:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-18 09:57:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-18 09:57:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:57:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-18 09:57:38,970 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-18 09:57:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:38,970 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-18 09:57:38,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:57:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-18 09:57:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:57:38,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:38,971 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-18 09:57:38,971 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-18 09:57:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:38,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:38,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:57:41,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:41,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:41,084 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:57:41,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:41,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:41,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:41,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:41,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:57:41,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:57:47,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:47,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-18 09:57:47,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:47,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:57:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:57:47,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:57:47,558 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-18 09:57:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:48,202 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-18 09:57:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 09:57:48,202 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-18 09:57:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:48,204 INFO L225 Difference]: With dead ends: 238 [2019-02-18 09:57:48,204 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:57:48,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:57:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:57:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-18 09:57:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-18 09:57:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-18 09:57:48,208 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-18 09:57:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:48,208 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-18 09:57:48,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:57:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-18 09:57:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-18 09:57:48,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:48,209 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-18 09:57:48,209 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-18 09:57:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:48,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:57:50,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:50,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:50,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:50,693 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:57:50,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:50,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:50,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:50,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:55,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 09:57:55,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:55,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:57:55,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:58:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:01,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-18 09:58:01,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:01,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:58:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:58:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:58:01,855 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-18 09:58:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:02,630 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-18 09:58:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:58:02,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-18 09:58:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:02,631 INFO L225 Difference]: With dead ends: 241 [2019-02-18 09:58:02,631 INFO L226 Difference]: Without dead ends: 161 [2019-02-18 09:58:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:58:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-18 09:58:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-18 09:58:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:58:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-18 09:58:02,637 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-18 09:58:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:02,637 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-18 09:58:02,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:58:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-18 09:58:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:58:02,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:02,638 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-18 09:58:02,638 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-18 09:58:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:02,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:02,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:58:05,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:05,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:05,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:05,096 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:58:05,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:05,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:05,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:05,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:05,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:05,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:05,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:58:05,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:58:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:11,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-18 09:58:11,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:58:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:58:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:58:11,872 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-18 09:58:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:12,736 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-18 09:58:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 09:58:12,737 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-18 09:58:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:12,737 INFO L225 Difference]: With dead ends: 244 [2019-02-18 09:58:12,738 INFO L226 Difference]: Without dead ends: 163 [2019-02-18 09:58:12,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:58:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-18 09:58:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-18 09:58:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-18 09:58:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-18 09:58:12,743 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-18 09:58:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:12,743 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-18 09:58:12,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:58:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-18 09:58:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-18 09:58:12,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:12,744 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-18 09:58:12,744 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-18 09:58:12,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:12,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:12,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:12,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:58:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:15,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:15,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:15,280 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:58:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:15,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:15,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:15,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:58:15,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:58:22,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:22,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-18 09:58:22,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:22,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:58:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:58:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:58:22,453 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-18 09:58:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:23,309 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-18 09:58:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 09:58:23,310 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-18 09:58:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:23,311 INFO L225 Difference]: With dead ends: 247 [2019-02-18 09:58:23,311 INFO L226 Difference]: Without dead ends: 165 [2019-02-18 09:58:23,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:58:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-18 09:58:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-18 09:58:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 09:58:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-18 09:58:23,314 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-18 09:58:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:23,315 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-18 09:58:23,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:58:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-18 09:58:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-18 09:58:23,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:23,316 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-18 09:58:23,316 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-18 09:58:23,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:23,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:23,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:58:26,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:26,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:26,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:26,009 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:58:26,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:26,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:26,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:29,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-18 09:58:29,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:29,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:58:29,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:58:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:36,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-18 09:58:36,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:36,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:58:36,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:58:36,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:58:36,471 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-18 09:58:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:37,309 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-18 09:58:37,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:58:37,309 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-18 09:58:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:37,310 INFO L225 Difference]: With dead ends: 250 [2019-02-18 09:58:37,310 INFO L226 Difference]: Without dead ends: 167 [2019-02-18 09:58:37,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:58:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-18 09:58:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-18 09:58:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-18 09:58:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-18 09:58:37,314 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-18 09:58:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:37,314 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-18 09:58:37,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:58:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-18 09:58:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-18 09:58:37,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:37,315 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-18 09:58:37,315 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-18 09:58:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:37,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:37,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:58:39,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:39,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:39,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:39,853 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:58:39,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:39,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:39,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:39,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:39,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:39,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:39,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:58:40,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:58:47,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-18 09:58:47,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:47,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:58:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:58:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:58:47,131 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-18 09:58:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:47,859 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-18 09:58:47,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 09:58:47,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-18 09:58:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:47,860 INFO L225 Difference]: With dead ends: 253 [2019-02-18 09:58:47,860 INFO L226 Difference]: Without dead ends: 169 [2019-02-18 09:58:47,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:58:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-18 09:58:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-18 09:58:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-18 09:58:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-18 09:58:47,864 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-18 09:58:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:47,865 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-18 09:58:47,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:58:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-18 09:58:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-18 09:58:47,865 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:47,865 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-18 09:58:47,865 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-18 09:58:47,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:47,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:47,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:58:50,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:50,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:50,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:50,695 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:58:50,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:50,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:50,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:50,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:50,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:58:50,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:58:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:57,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-18 09:58:57,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:57,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:58:57,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:58:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:58:57,948 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-18 09:58:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:58,857 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-18 09:58:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 09:58:58,858 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-18 09:58:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:58,858 INFO L225 Difference]: With dead ends: 256 [2019-02-18 09:58:58,858 INFO L226 Difference]: Without dead ends: 171 [2019-02-18 09:58:58,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:58:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-18 09:58:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-18 09:58:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-18 09:58:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-18 09:58:58,862 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-18 09:58:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:58,862 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-18 09:58:58,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:58:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-18 09:58:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-18 09:58:58,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:58,863 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-18 09:58:58,863 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-18 09:58:58,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:58,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:59:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:01,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:01,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:01,693 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:59:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:01,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:01,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:10,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-18 09:59:10,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:10,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:59:10,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:59:18,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:18,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-18 09:59:18,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:18,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:59:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:59:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:59:18,434 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-18 09:59:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:19,395 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-18 09:59:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:59:19,395 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-18 09:59:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:19,396 INFO L225 Difference]: With dead ends: 259 [2019-02-18 09:59:19,396 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:59:19,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:59:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:59:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-18 09:59:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-18 09:59:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-18 09:59:19,401 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-18 09:59:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:19,402 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-18 09:59:19,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:59:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-18 09:59:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-18 09:59:19,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:19,403 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-18 09:59:19,403 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-18 09:59:19,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:19,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:19,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:59:22,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:22,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:22,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:22,281 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:59:22,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:22,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:22,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:22,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:22,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:22,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:22,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:59:22,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:59:30,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:30,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-18 09:59:30,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:30,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:59:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:59:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:59:30,190 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-18 09:59:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:31,221 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-18 09:59:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 09:59:31,221 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-18 09:59:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:31,222 INFO L225 Difference]: With dead ends: 262 [2019-02-18 09:59:31,222 INFO L226 Difference]: Without dead ends: 175 [2019-02-18 09:59:31,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:59:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-18 09:59:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-18 09:59:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-18 09:59:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-18 09:59:31,249 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-18 09:59:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:31,249 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-18 09:59:31,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:59:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-18 09:59:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-18 09:59:31,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:31,252 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-18 09:59:31,253 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-18 09:59:31,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:31,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:31,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:59:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:33,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:33,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:33,929 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:59:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:33,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:33,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:34,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:59:34,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:59:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-18 09:59:42,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:42,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:59:42,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:59:42,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:59:42,077 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-18 09:59:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:43,103 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-18 09:59:43,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 09:59:43,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-18 09:59:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:43,105 INFO L225 Difference]: With dead ends: 265 [2019-02-18 09:59:43,105 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 09:59:43,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:59:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 09:59:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-18 09:59:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-18 09:59:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-18 09:59:43,109 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-18 09:59:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:43,109 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-18 09:59:43,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:59:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-18 09:59:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-18 09:59:43,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:43,110 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-18 09:59:43,111 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-18 09:59:43,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:43,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 09:59:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:45,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:45,819 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:59:45,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:45,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:45,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:45,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:55,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-18 09:59:55,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:55,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 09:59:55,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 10:00:03,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:03,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-18 10:00:03,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:03,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 10:00:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 10:00:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 10:00:03,690 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-18 10:00:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:04,588 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-18 10:00:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 10:00:04,588 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-18 10:00:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:04,589 INFO L225 Difference]: With dead ends: 268 [2019-02-18 10:00:04,590 INFO L226 Difference]: Without dead ends: 179 [2019-02-18 10:00:04,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 10:00:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-18 10:00:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-18 10:00:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-18 10:00:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-18 10:00:04,594 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-18 10:00:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:04,594 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-18 10:00:04,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 10:00:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-18 10:00:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-18 10:00:04,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:04,595 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-18 10:00:04,595 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-18 10:00:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:04,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:04,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 10:00:07,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:07,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:07,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:07,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:07,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:07,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:07,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:07,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:07,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:07,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 10:00:07,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 10:00:15,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:15,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-18 10:00:15,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:15,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 10:00:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 10:00:15,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:00:15,930 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-18 10:00:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:17,075 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-18 10:00:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 10:00:17,075 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-18 10:00:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:17,076 INFO L225 Difference]: With dead ends: 271 [2019-02-18 10:00:17,076 INFO L226 Difference]: Without dead ends: 181 [2019-02-18 10:00:17,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:00:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-18 10:00:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-18 10:00:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-18 10:00:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-18 10:00:17,080 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-18 10:00:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-18 10:00:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 10:00:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-18 10:00:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-18 10:00:17,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:17,081 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-18 10:00:17,082 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-18 10:00:17,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:17,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:17,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 10:00:20,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:20,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:20,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:20,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:20,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:20,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:20,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:20,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:20,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 10:00:20,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 10:00:29,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:29,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-18 10:00:29,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:29,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 10:00:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 10:00:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 10:00:29,078 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-18 10:00:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:30,010 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-18 10:00:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 10:00:30,011 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-18 10:00:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:30,011 INFO L225 Difference]: With dead ends: 274 [2019-02-18 10:00:30,011 INFO L226 Difference]: Without dead ends: 183 [2019-02-18 10:00:30,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 10:00:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-18 10:00:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-18 10:00:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-18 10:00:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-18 10:00:30,016 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-18 10:00:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:30,016 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-18 10:00:30,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 10:00:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-18 10:00:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-18 10:00:30,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:30,017 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-18 10:00:30,017 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-18 10:00:30,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 10:00:33,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:33,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:33,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:33,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 10:00:33,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:33,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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:33,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:38,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-18 10:00:38,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:38,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 10:00:38,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 10:00:47,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:47,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-18 10:00:47,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:47,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 10:00:47,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 10:00:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 10:00:47,041 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-18 10:00:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:47,970 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-18 10:00:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 10:00:47,970 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-18 10:00:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:47,971 INFO L225 Difference]: With dead ends: 277 [2019-02-18 10:00:47,971 INFO L226 Difference]: Without dead ends: 185 [2019-02-18 10:00:47,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 10:00:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-18 10:00:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-18 10:00:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 10:00:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-18 10:00:47,976 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-18 10:00:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-18 10:00:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 10:00:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-18 10:00:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 10:00:47,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:47,978 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-18 10:00:47,978 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-18 10:00:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:47,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:47,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 10:00:50,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:50,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:50,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:50,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:50,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:50,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:50,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:51,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:51,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:51,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 10:00:51,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 10:01:00,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:00,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-18 10:01:00,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:00,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 10:01:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 10:01:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:01:00,191 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-18 10:01:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:01,174 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-18 10:01:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 10:01:01,174 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-18 10:01:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:01,175 INFO L225 Difference]: With dead ends: 280 [2019-02-18 10:01:01,175 INFO L226 Difference]: Without dead ends: 187 [2019-02-18 10:01:01,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:01:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-18 10:01:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-18 10:01:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-18 10:01:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-18 10:01:01,180 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-18 10:01:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:01,180 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-18 10:01:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 10:01:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-18 10:01:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-18 10:01:01,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:01,181 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-18 10:01:01,182 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-18 10:01:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:01,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:01,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 10:01:04,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:04,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:04,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:04,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:04,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:04,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:04,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:04,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 10:01:04,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 10:01:13,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:13,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-18 10:01:13,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:13,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 10:01:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 10:01:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:01:13,999 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-18 10:01:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:15,249 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-18 10:01:15,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 10:01:15,249 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-18 10:01:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:15,250 INFO L225 Difference]: With dead ends: 283 [2019-02-18 10:01:15,250 INFO L226 Difference]: Without dead ends: 189 [2019-02-18 10:01:15,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:01:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-18 10:01:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-18 10:01:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-18 10:01:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-18 10:01:15,255 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-18 10:01:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:15,255 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-18 10:01:15,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 10:01:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-18 10:01:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-18 10:01:15,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:15,256 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-18 10:01:15,257 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-18 10:01:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:15,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:15,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:15,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:15,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 10:01:18,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:18,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:18,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:18,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:18,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:18,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:18,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:23,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-18 10:01:23,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:23,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 10:01:23,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 10:01:33,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:33,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-18 10:01:33,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:33,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 10:01:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 10:01:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 10:01:33,030 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-18 10:01:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:34,136 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-18 10:01:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 10:01:34,136 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-18 10:01:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:34,137 INFO L225 Difference]: With dead ends: 286 [2019-02-18 10:01:34,137 INFO L226 Difference]: Without dead ends: 191 [2019-02-18 10:01:34,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 10:01:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-18 10:01:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-18 10:01:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-18 10:01:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-18 10:01:34,145 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-18 10:01:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:34,145 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-18 10:01:34,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 10:01:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-18 10:01:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-18 10:01:34,146 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:34,146 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-18 10:01:34,147 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-18 10:01:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:34,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:34,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 10:01:37,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:37,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:37,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:37,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:37,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:37,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:37,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:37,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:37,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:37,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 10:01:37,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 10:01:47,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:47,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-18 10:01:47,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:47,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 10:01:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 10:01:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:01:47,035 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-18 10:01:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:48,389 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-18 10:01:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 10:01:48,389 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-18 10:01:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:48,390 INFO L225 Difference]: With dead ends: 289 [2019-02-18 10:01:48,390 INFO L226 Difference]: Without dead ends: 193 [2019-02-18 10:01:48,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:01:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-18 10:01:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-18 10:01:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 10:01:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-18 10:01:48,396 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-18 10:01:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:48,396 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-18 10:01:48,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 10:01:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-18 10:01:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-18 10:01:48,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:48,397 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-18 10:01:48,397 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-18 10:01:48,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:48,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:48,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 10:01:51,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:51,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:51,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:51,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:51,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:51,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:51,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:52,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 10:01:52,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 10:02:01,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:01,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-18 10:02:01,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:01,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 10:02:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 10:02:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:02:01,939 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-18 10:02:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:03,342 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-18 10:02:03,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-18 10:02:03,342 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-18 10:02:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:03,343 INFO L225 Difference]: With dead ends: 292 [2019-02-18 10:02:03,343 INFO L226 Difference]: Without dead ends: 195 [2019-02-18 10:02:03,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:02:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-18 10:02:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-18 10:02:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-18 10:02:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-18 10:02:03,348 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-18 10:02:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:03,348 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-18 10:02:03,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 10:02:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-18 10:02:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-18 10:02:03,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:03,349 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-18 10:02:03,350 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-18 10:02:03,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:03,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:03,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 10:02:06,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:06,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:06,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:06,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:06,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:06,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:06,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:06,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:13,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-18 10:02:13,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:13,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 10:02:13,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 10:02:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-18 10:02:23,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:23,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 10:02:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 10:02:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:02:23,231 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-18 10:02:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:24,734 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-18 10:02:24,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-18 10:02:24,734 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-18 10:02:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:24,735 INFO L225 Difference]: With dead ends: 295 [2019-02-18 10:02:24,735 INFO L226 Difference]: Without dead ends: 197 [2019-02-18 10:02:24,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:02:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-18 10:02:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-18 10:02:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-18 10:02:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-18 10:02:24,741 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-18 10:02:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:24,741 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-18 10:02:24,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 10:02:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-18 10:02:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-18 10:02:24,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:24,742 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-18 10:02:24,742 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-18 10:02:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:24,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:24,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 10:02:28,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:28,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:28,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:28,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:28,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:28,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:28,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:28,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:28,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:28,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 10:02:28,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 10:02:38,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:38,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-18 10:02:38,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:38,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 10:02:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 10:02:38,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:02:38,976 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-18 10:02:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:40,520 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-18 10:02:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 10:02:40,520 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-18 10:02:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:40,521 INFO L225 Difference]: With dead ends: 298 [2019-02-18 10:02:40,521 INFO L226 Difference]: Without dead ends: 199 [2019-02-18 10:02:40,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:02:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-18 10:02:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-18 10:02:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-18 10:02:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-18 10:02:40,525 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-18 10:02:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:40,525 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-18 10:02:40,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 10:02:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-18 10:02:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-18 10:02:40,526 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:40,526 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-18 10:02:40,526 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-18 10:02:40,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:40,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:40,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 10:02:44,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:44,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:44,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:44,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:44,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:44,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:44,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:44,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 10:02:44,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 10:02:54,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:54,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-18 10:02:54,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:54,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 10:02:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 10:02:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:02:54,682 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-18 10:02:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:55,922 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-18 10:02:55,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-18 10:02:55,922 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-18 10:02:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:55,923 INFO L225 Difference]: With dead ends: 301 [2019-02-18 10:02:55,923 INFO L226 Difference]: Without dead ends: 201 [2019-02-18 10:02:55,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:02:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-18 10:02:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-18 10:02:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-18 10:02:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-18 10:02:55,928 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-18 10:02:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:55,928 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-18 10:02:55,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 10:02:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-18 10:02:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-18 10:02:55,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:55,929 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-18 10:02:55,930 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-18 10:02:55,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:55,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:55,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:55,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:55,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 10:02:59,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:59,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:59,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:59,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:59,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:59,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:59,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:59,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:14,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-18 10:03:14,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:14,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 10:03:14,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 10:03:25,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:25,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-18 10:03:25,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:25,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 10:03:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 10:03:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 10:03:25,671 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-18 10:03:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:27,249 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-18 10:03:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-18 10:03:27,250 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-18 10:03:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:27,250 INFO L225 Difference]: With dead ends: 304 [2019-02-18 10:03:27,251 INFO L226 Difference]: Without dead ends: 203 [2019-02-18 10:03:27,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 10:03:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-18 10:03:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-18 10:03:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-18 10:03:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-18 10:03:27,255 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-18 10:03:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:27,255 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-18 10:03:27,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 10:03:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-18 10:03:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-18 10:03:27,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:27,256 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-18 10:03:27,256 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-18 10:03:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:27,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:27,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:27,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 10:03:30,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:30,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:30,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:30,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:30,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:30,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:30,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:30,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:30,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:30,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 10:03:30,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 10:03:41,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:41,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-18 10:03:41,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:41,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 10:03:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 10:03:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:03:41,793 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-18 10:03:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:43,365 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-18 10:03:43,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-18 10:03:43,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-18 10:03:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:43,366 INFO L225 Difference]: With dead ends: 307 [2019-02-18 10:03:43,366 INFO L226 Difference]: Without dead ends: 205 [2019-02-18 10:03:43,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:03:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-18 10:03:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-18 10:03:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-18 10:03:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-18 10:03:43,370 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-18 10:03:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:43,370 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-18 10:03:43,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 10:03:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-18 10:03:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-18 10:03:43,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:43,371 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-18 10:03:43,371 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-18 10:03:43,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:43,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:43,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 10:03:46,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:46,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:46,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:46,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:46,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:46,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:46,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:03:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:47,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 10:03:47,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 10:03:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-18 10:03:58,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:58,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 10:03:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 10:03:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 10:03:58,179 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-18 10:03:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:59,813 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-18 10:03:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 10:03:59,813 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-18 10:03:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:59,815 INFO L225 Difference]: With dead ends: 310 [2019-02-18 10:03:59,815 INFO L226 Difference]: Without dead ends: 207 [2019-02-18 10:03:59,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 10:03:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-18 10:03:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-18 10:03:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-18 10:03:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-18 10:03:59,821 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-18 10:03:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:59,822 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-18 10:03:59,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 10:03:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-18 10:03:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-18 10:03:59,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:59,823 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-18 10:03:59,823 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-18 10:03:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:59,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 10:04:03,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:03,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:03,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:03,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:03,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:03,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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:03,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:22,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-18 10:04:22,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:22,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 10:04:22,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 10:04:34,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:34,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-18 10:04:34,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:34,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 10:04:34,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 10:04:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 10:04:34,044 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-18 10:04:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:35,851 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-18 10:04:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-18 10:04:35,851 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-18 10:04:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:35,852 INFO L225 Difference]: With dead ends: 313 [2019-02-18 10:04:35,852 INFO L226 Difference]: Without dead ends: 209 [2019-02-18 10:04:35,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 10:04:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-18 10:04:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-18 10:04:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-18 10:04:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-18 10:04:35,859 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-18 10:04:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-18 10:04:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 10:04:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-18 10:04:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-18 10:04:35,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:35,860 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-18 10:04:35,861 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-18 10:04:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:35,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:35,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 10:04:40,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:40,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:40,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:40,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:40,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:40,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:40,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:04:40,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:04:40,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:04:40,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:40,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 10:04:40,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 10:04:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-18 10:04:51,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:51,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 10:04:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 10:04:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:04:51,646 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-18 10:04:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:53,204 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-18 10:04:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-18 10:04:53,205 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-18 10:04:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:53,205 INFO L225 Difference]: With dead ends: 316 [2019-02-18 10:04:53,205 INFO L226 Difference]: Without dead ends: 211 [2019-02-18 10:04:53,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:04:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-18 10:04:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-18 10:04:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-18 10:04:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-18 10:04:53,212 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-18 10:04:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:53,213 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-18 10:04:53,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 10:04:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-18 10:04:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-18 10:04:53,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:53,214 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-18 10:04:53,214 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-18 10:04:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:53,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:53,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 10:04:57,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:57,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:57,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:57,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:57,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:57,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:57,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:57,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:57,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 10:04:57,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 10:05:09,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:09,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-18 10:05:09,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:09,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 10:05:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 10:05:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 10:05:09,494 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-18 10:05:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:11,295 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-18 10:05:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-18 10:05:11,296 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-18 10:05:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:11,297 INFO L225 Difference]: With dead ends: 319 [2019-02-18 10:05:11,297 INFO L226 Difference]: Without dead ends: 213 [2019-02-18 10:05:11,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 10:05:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-18 10:05:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-18 10:05:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 10:05:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-18 10:05:11,303 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-18 10:05:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:11,303 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-18 10:05:11,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 10:05:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-18 10:05:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 10:05:11,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:11,305 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-18 10:05:11,305 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:11,305 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-18 10:05:11,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:11,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:11,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-18 10:05:15,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:15,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:15,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:15,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:15,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:15,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:05:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:05:15,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:05:24,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-18 10:05:24,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:24,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-18 10:05:24,804 INFO L316 TraceCheckSpWp]: Computing backward predicates...