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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:56:57,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:56:57,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:56:57,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:56:57,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:56:57,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:56:57,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:56:57,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:56:57,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:56:57,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:56:57,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:56:57,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:56:57,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:56:57,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:56:57,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:56:57,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:56:57,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:56:57,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:56:57,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:56:57,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:56:57,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:56:57,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:56:57,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:56:57,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:56:57,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:56:57,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:56:57,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:56:57,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:56:57,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:56:57,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:56:57,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:56:57,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:56:57,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:56:57,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:56:57,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:56:57,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:56:57,932 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-01-18 17:56:57,950 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:56:57,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:56:57,951 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:56:57,951 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:56:57,952 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:56:57,952 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:56:57,952 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:56:57,952 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:56:57,952 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:56:57,953 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:56:57,953 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:56:57,953 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:56:57,953 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:56:57,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:56:57,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:56:57,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:56:57,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:56:57,955 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:56:57,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:56:57,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:56:57,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:56:57,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:56:57,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:56:57,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:56:57,957 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:56:57,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:56:57,959 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:56:57,959 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:56:57,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:56:57,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:56:57,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:56:57,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:56:57,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:56:57,961 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:56:58,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:56:58,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:56:58,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:56:58,017 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:56:58,017 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:56:58,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-18 17:56:58,018 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-18 17:56:58,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:56:58,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:56:58,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:56:58,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:56:58,061 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:56:58,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,096 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 17:56:58,096 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 17:56:58,097 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 17:56:58,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:56:58,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:56:58,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:56:58,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:56:58,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... [2019-01-18 17:56:58,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:56:58,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:56:58,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:56:58,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:56:58,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:56:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-18 17:56:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 17:56:58,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 17:56:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-18 17:56:58,599 INFO L278 CfgBuilder]: Using library mode [2019-01-18 17:56:58,599 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-18 17:56:58,601 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:56:58 BoogieIcfgContainer [2019-01-18 17:56:58,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:56:58,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:56:58,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:56:58,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:56:58,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:56:58" (1/2) ... [2019-01-18 17:56:58,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61630cd and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:56:58, skipping insertion in model container [2019-01-18 17:56:58,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:56:58" (2/2) ... [2019-01-18 17:56:58,608 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-18 17:56:58,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:56:58,628 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-18 17:56:58,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-18 17:56:58,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:56:58,684 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:56:58,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:56:58,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:56:58,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:56:58,684 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:56:58,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:56:58,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:56:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-18 17:56:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:56:58,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:58,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:56:58,717 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:56:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-18 17:56:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:58,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:59,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:56:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:56:59,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:56:59,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:56:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:56:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:56:59,093 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-18 17:56:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:59,218 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-18 17:56:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:56:59,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:56:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:59,232 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:56:59,233 INFO L226 Difference]: Without dead ends: 10 [2019-01-18 17:56:59,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:56:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-18 17:56:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-18 17:56:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:56:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-18 17:56:59,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-18 17:56:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:59,270 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-18 17:56:59,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:56:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-18 17:56:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:56:59,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:59,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:56:59,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:56:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-18 17:56:59,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:59,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:59,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:59,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:56:59,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:56:59,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:56:59,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:56:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:56:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:56:59,583 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-18 17:56:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:59,807 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-18 17:56:59,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:56:59,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-18 17:56:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:59,808 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:56:59,809 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:56:59,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:56:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:56:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-18 17:56:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:56:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-18 17:56:59,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-18 17:56:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:59,815 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-18 17:56:59,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:56:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-18 17:56:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:56:59,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:59,816 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 17:56:59,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:56:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-18 17:56:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:59,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:56:59,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:56:59,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:56:59,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:56:59,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:56:59,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:56:59,877 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-18 17:56:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:59,906 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-18 17:56:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:56:59,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-18 17:56:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:59,907 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:56:59,907 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:56:59,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:56:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:56:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:56:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:56:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-18 17:56:59,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-18 17:56:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:59,912 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-18 17:56:59,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:56:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-18 17:56:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:56:59,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:59,913 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-18 17:56:59,913 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:56:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-18 17:56:59,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:59,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:00,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:00,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:00,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 17:57:00,047 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-18 17:57:00,100 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:57:00,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:57:57,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:57:57,958 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:57:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:57,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:57:57,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:57,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:57,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:58,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:58,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:57:58,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:58,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:57:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:58,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:58,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:58,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:57:58,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:58,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:57:58,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:57:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:57:58,443 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-18 17:57:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:58,749 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:57:58,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:57:58,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-18 17:57:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:58,752 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:57:58,752 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:57:58,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:57:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:57:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-18 17:57:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:57:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:57:58,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-18 17:57:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:58,760 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:57:58,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:57:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:57:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:57:58,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:58,761 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-18 17:57:58,761 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:57:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-18 17:57:58,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:58,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:58,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:58,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:58,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:58,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:58,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:58,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:58,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:58,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:58,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:58,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:57:58,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:58,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:57:58,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:59,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:59,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:57:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:59,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:59,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:59,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:57:59,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:59,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:57:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:57:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:57:59,646 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-18 17:57:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:59,891 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-18 17:57:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:57:59,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-18 17:57:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:59,894 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:57:59,894 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:57:59,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:57:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:57:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-18 17:57:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:57:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-18 17:57:59,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-18 17:57:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:59,900 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-18 17:57:59,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:57:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-18 17:57:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:57:59,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:59,901 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-18 17:57:59,902 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:57:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-18 17:57:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:59,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:59,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:00,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:00,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:00,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:00,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:00,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:00,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:00,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:00,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:00,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:58:00,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:00,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:58:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:58:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:58:00,608 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-18 17:58:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:00,792 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:58:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:58:00,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-18 17:58:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:00,795 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:58:00,795 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:58:00,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:58:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:58:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-18 17:58:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:58:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:58:00,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-18 17:58:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:58:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:58:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:58:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:58:00,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:00,802 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-18 17:58:00,803 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-18 17:58:00,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:00,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:00,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:00,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:00,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:00,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:00,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:00,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:00,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:01,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:01,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-18 17:58:01,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:01,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:58:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:58:01,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:58:01,167 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-18 17:58:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:01,437 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-18 17:58:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:58:01,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-18 17:58:01,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:01,440 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:58:01,440 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:58:01,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:58:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:58:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-18 17:58:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:58:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-18 17:58:01,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-18 17:58:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:01,447 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-18 17:58:01,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:58:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-18 17:58:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:58:01,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:01,448 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-18 17:58:01,448 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-18 17:58:01,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:01,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:01,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:01,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:01,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:01,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:01,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:01,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:01,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:01,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:01,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:01,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:01,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:01,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:58:01,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:01,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:01,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:01,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:01,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:01,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:01,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:01,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:01,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-18 17:58:01,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:01,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:58:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:58:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:58:01,898 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-18 17:58:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:02,408 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:58:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:58:02,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-18 17:58:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:02,410 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:58:02,410 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:58:02,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:58:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:58:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-18 17:58:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:58:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:58:02,417 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-18 17:58:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:02,418 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:58:02,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:58:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:58:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:58:02,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:02,419 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-18 17:58:02,419 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-18 17:58:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:02,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:02,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:02,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:02,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:02,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:02,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:02,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:02,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:02,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:02,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:02,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:02,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:02,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:02,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:02,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:02,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:02,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:02,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:02,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:02,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-18 17:58:02,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:02,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:58:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:58:02,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:58:02,983 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-18 17:58:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:03,307 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-18 17:58:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:58:03,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-18 17:58:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:03,308 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:58:03,309 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:58:03,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:58:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:58:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-18 17:58:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:58:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-18 17:58:03,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-18 17:58:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:03,317 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-18 17:58:03,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:58:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-18 17:58:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:58:03,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:03,319 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-18 17:58:03,319 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-18 17:58:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:03,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:03,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:03,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:03,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:03,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:03,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:03,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:03,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:03,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:03,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:03,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:03,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:03,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:03,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:03,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:04,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-18 17:58:04,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:04,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:58:04,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:58:04,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:58:04,022 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-18 17:58:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:04,387 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:58:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:58:04,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-18 17:58:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:04,389 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:58:04,389 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:58:04,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:58:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:58:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-18 17:58:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:58:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:58:04,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-18 17:58:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:04,397 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:58:04,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:58:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:58:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:58:04,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:04,399 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-18 17:58:04,399 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-18 17:58:04,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:04,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:04,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:05,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:05,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:05,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:05,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:05,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:05,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:05,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:05,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:58:05,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:05,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:05,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:05,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:05,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:05,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:05,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:05,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:05,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-18 17:58:05,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:05,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:58:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:58:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:58:05,752 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-18 17:58:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:06,048 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-18 17:58:06,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:58:06,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-18 17:58:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:06,050 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:58:06,050 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:58:06,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:58:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:58:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-18 17:58:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:58:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-18 17:58:06,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-18 17:58:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:06,061 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-18 17:58:06,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:58:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-18 17:58:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:58:06,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:06,062 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-18 17:58:06,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-18 17:58:06,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:06,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:06,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:06,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:06,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:06,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:06,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:06,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:06,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:06,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:06,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:06,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:06,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:06,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:06,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-18 17:58:06,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:06,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:58:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:58:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-18 17:58:06,937 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-18 17:58:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:07,311 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:58:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:58:07,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-18 17:58:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:07,313 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:58:07,313 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:58:07,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:58:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:58:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-18 17:58:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:58:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:58:07,322 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-18 17:58:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:07,323 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:58:07,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:58:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:58:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:58:07,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:07,324 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-18 17:58:07,324 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-18 17:58:07,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:07,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:07,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:07,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:08,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:08,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:08,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:08,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:08,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:08,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:08,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:08,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:08,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:08,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:08,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:08,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:08,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:08,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:08,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:08,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-18 17:58:08,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:08,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:58:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:58:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:58:08,996 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-18 17:58:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:09,443 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-18 17:58:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:58:09,444 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-18 17:58:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:09,444 INFO L225 Difference]: With dead ends: 65 [2019-01-18 17:58:09,445 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:58:09,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:58:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:58:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-18 17:58:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:58:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-18 17:58:09,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-18 17:58:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:09,456 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-18 17:58:09,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:58:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-18 17:58:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:58:09,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:09,457 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-18 17:58:09,457 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-18 17:58:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:09,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:09,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:09,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:09,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:09,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:09,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:09,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:09,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:09,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:09,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-18 17:58:09,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:09,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:09,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:09,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:09,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:09,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:10,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:10,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:10,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-18 17:58:10,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:10,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:58:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:58:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-18 17:58:10,312 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-18 17:58:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:10,810 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:58:10,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:58:10,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-18 17:58:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:10,811 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:58:10,811 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:58:10,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:58:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:58:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-18 17:58:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:58:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:58:10,823 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-18 17:58:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:10,824 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:58:10,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:58:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:58:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:58:10,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:10,825 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-18 17:58:10,825 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-18 17:58:10,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:10,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:10,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:10,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:11,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:11,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:11,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:11,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:11,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:11,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:11,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:11,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:11,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:11,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:11,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:11,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:11,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:11,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:11,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:11,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:12,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:12,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-18 17:58:12,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:58:12,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:58:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:58:12,131 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-18 17:58:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:12,763 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-18 17:58:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:58:12,766 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-18 17:58:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:12,767 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:58:12,767 INFO L226 Difference]: Without dead ends: 74 [2019-01-18 17:58:12,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:58:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-18 17:58:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-18 17:58:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:58:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-18 17:58:12,779 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-18 17:58:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:12,780 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-18 17:58:12,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:58:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-18 17:58:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:58:12,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:12,781 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-18 17:58:12,781 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-18 17:58:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:12,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:12,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:12,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:13,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:13,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:13,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:13,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:13,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:13,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:13,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:13,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:13,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:13,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:13,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:13,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:13,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:14,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:14,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-18 17:58:14,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:14,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:58:14,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:58:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:58:14,689 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-18 17:58:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:15,208 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:58:15,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:58:15,208 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-18 17:58:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:15,209 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:58:15,209 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:58:15,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:58:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:58:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-18 17:58:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:58:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:58:15,222 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-18 17:58:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:58:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:58:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:58:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:58:15,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:15,224 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-18 17:58:15,224 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-18 17:58:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:15,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:15,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:15,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:15,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:15,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:15,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:15,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:15,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:15,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:15,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:58:15,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:15,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:15,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:15,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:15,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:15,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:15,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-18 17:58:16,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:58:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:58:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:58:16,346 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-18 17:58:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:16,897 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-18 17:58:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:58:16,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-18 17:58:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:16,898 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:58:16,898 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:58:16,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:58:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:58:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-18 17:58:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:58:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-18 17:58:16,911 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-18 17:58:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:16,911 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-18 17:58:16,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:58:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-18 17:58:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:58:16,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:16,912 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-18 17:58:16,912 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-18 17:58:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:16,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:16,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:17,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:17,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:17,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:17,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:17,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:17,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:17,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:17,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:17,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:17,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:17,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:17,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:17,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:17,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:18,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:19,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-18 17:58:19,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:19,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:58:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:58:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:58:19,443 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-18 17:58:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:20,014 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:58:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:58:20,014 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-18 17:58:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:20,015 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:58:20,015 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:58:20,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:58:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:58:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-18 17:58:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:58:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:58:20,028 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-18 17:58:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:20,028 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:58:20,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:58:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:58:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:58:20,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:20,029 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-18 17:58:20,029 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-18 17:58:20,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:20,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:20,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:20,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:20,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:20,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:20,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:20,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:20,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:20,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:20,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:20,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:20,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:20,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:20,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:21,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:21,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-18 17:58:21,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:21,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:58:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:58:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:58:21,147 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-18 17:58:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:21,725 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-18 17:58:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:58:21,725 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-18 17:58:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:21,726 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:58:21,726 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:58:21,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:58:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:58:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-18 17:58:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:58:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-18 17:58:21,742 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-18 17:58:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:21,742 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-18 17:58:21,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:58:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-18 17:58:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:58:21,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:21,743 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-18 17:58:21,743 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-18 17:58:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:22,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:22,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:22,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:22,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:22,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:22,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:22,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:22,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:58:22,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:22,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:22,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:22,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:22,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:22,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:22,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:23,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:23,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-18 17:58:23,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:23,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:58:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:58:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:58:23,452 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-18 17:58:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:24,074 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 17:58:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:58:24,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-18 17:58:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:24,076 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:58:24,076 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:58:24,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:58:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:58:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-18 17:58:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:58:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 17:58:24,088 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-18 17:58:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:24,088 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 17:58:24,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:58:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 17:58:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 17:58:24,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:24,089 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-18 17:58:24,089 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-18 17:58:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:24,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:24,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:24,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:24,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:24,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:24,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:24,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:24,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:24,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:24,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:24,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:24,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:24,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:24,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:24,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:25,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:25,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-18 17:58:25,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:25,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:58:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:58:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:58:25,446 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-18 17:58:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:26,084 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-18 17:58:26,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:58:26,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-18 17:58:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:26,086 INFO L225 Difference]: With dead ends: 105 [2019-01-18 17:58:26,086 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 17:58:26,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:58:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 17:58:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-18 17:58:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:58:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-18 17:58:26,097 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-18 17:58:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:26,097 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-18 17:58:26,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:58:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-18 17:58:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:58:26,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:26,098 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-18 17:58:26,098 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-18 17:58:26,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:26,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:26,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:26,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:26,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:26,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:26,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:26,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:26,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:26,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:26,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:26,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:26,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:26,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:26,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:27,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:27,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:27,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-18 17:58:27,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:27,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:58:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:58:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-18 17:58:27,923 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-18 17:58:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:28,776 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 17:58:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:58:28,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-18 17:58:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:28,779 INFO L225 Difference]: With dead ends: 110 [2019-01-18 17:58:28,779 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:58:28,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:58:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:58:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-18 17:58:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 17:58:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 17:58:28,791 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-18 17:58:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:28,792 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 17:58:28,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:58:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 17:58:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 17:58:28,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:28,792 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-18 17:58:28,792 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-18 17:58:28,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:28,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:28,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:29,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:29,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:29,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:29,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:29,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:29,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:29,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:29,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:29,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-18 17:58:29,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:29,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:29,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:29,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:29,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:29,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:29,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-18 17:58:30,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:30,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:58:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:58:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:58:30,661 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-18 17:58:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:31,461 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-18 17:58:31,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:58:31,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-18 17:58:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:31,463 INFO L225 Difference]: With dead ends: 115 [2019-01-18 17:58:31,463 INFO L226 Difference]: Without dead ends: 114 [2019-01-18 17:58:31,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:58:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-18 17:58:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-18 17:58:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:58:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-18 17:58:31,477 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-18 17:58:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-18 17:58:31,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:58:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-18 17:58:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 17:58:31,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:31,479 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-18 17:58:31,479 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-18 17:58:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:31,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:31,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:34,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:34,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:34,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:34,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:34,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:34,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:34,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:34,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:34,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:34,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:34,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:34,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:34,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:35,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:35,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-18 17:58:35,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:35,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:58:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:58:35,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:58:35,432 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-18 17:58:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:36,324 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-18 17:58:36,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:58:36,325 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-18 17:58:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:36,326 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:58:36,326 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:58:36,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:58:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:58:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-18 17:58:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-18 17:58:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-18 17:58:36,346 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-18 17:58:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:36,346 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-18 17:58:36,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:58:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-18 17:58:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-18 17:58:36,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:36,347 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-18 17:58:36,347 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-18 17:58:36,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:36,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:36,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:36,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:37,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:37,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:37,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:37,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:37,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:37,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:37,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:37,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:37,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:37,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:37,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:37,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:37,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:37,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:38,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:38,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-18 17:58:38,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:38,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:58:38,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:58:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:58:38,863 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-18 17:58:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:39,894 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-18 17:58:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:58:39,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-18 17:58:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:39,896 INFO L225 Difference]: With dead ends: 125 [2019-01-18 17:58:39,896 INFO L226 Difference]: Without dead ends: 124 [2019-01-18 17:58:39,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:58:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-18 17:58:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-18 17:58:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-18 17:58:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-18 17:58:39,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-18 17:58:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:39,912 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-18 17:58:39,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:58:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-18 17:58:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-18 17:58:39,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:39,913 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-18 17:58:39,913 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-18 17:58:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:39,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:39,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:40,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:40,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:40,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:40,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:40,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:40,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:40,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:40,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:58:40,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:40,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:40,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:40,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:40,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:40,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:41,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:42,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:42,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-18 17:58:42,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:42,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:58:42,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:58:42,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-18 17:58:42,057 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-18 17:58:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:43,009 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-18 17:58:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:58:43,010 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-18 17:58:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:43,011 INFO L225 Difference]: With dead ends: 130 [2019-01-18 17:58:43,011 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 17:58:43,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:58:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 17:58:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-18 17:58:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-18 17:58:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-18 17:58:43,028 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-18 17:58:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:43,028 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-18 17:58:43,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:58:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-18 17:58:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-18 17:58:43,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:43,029 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-18 17:58:43,030 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-18 17:58:43,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:43,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:43,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:43,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:43,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:43,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:43,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:43,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:43,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:43,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:43,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:43,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:44,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:44,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:44,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:44,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:44,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:44,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:44,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:44,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-18 17:58:45,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:45,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:58:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:58:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:58:45,580 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-18 17:58:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:46,524 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-18 17:58:46,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:58:46,524 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-18 17:58:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:46,525 INFO L225 Difference]: With dead ends: 135 [2019-01-18 17:58:46,525 INFO L226 Difference]: Without dead ends: 134 [2019-01-18 17:58:46,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:58:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-18 17:58:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-18 17:58:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-18 17:58:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-18 17:58:46,548 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-18 17:58:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:46,548 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-18 17:58:46,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:58:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-18 17:58:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-18 17:58:46,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:46,549 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-18 17:58:46,549 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-18 17:58:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:46,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:46,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:47,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:47,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:47,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:47,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:47,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:47,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:47,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:47,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:47,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:47,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:47,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:47,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:49,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-18 17:58:49,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:58:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:58:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-18 17:58:49,076 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-18 17:58:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:50,186 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-18 17:58:50,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:58:50,186 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-18 17:58:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:50,187 INFO L225 Difference]: With dead ends: 140 [2019-01-18 17:58:50,187 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 17:58:50,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:58:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 17:58:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-18 17:58:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-18 17:58:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-18 17:58:50,204 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-18 17:58:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:50,204 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-18 17:58:50,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:58:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-18 17:58:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-18 17:58:50,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:50,205 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-18 17:58:50,205 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-18 17:58:50,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:50,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:50,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:50,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:50,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:50,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:50,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:50,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:50,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:50,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:50,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:50,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:58:50,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:50,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:50,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:50,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:51,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:51,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:52,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:53,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:53,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-18 17:58:53,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:53,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:58:53,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:58:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:58:53,584 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-18 17:58:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:54,868 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-18 17:58:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:58:54,868 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-18 17:58:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:54,869 INFO L225 Difference]: With dead ends: 145 [2019-01-18 17:58:54,869 INFO L226 Difference]: Without dead ends: 144 [2019-01-18 17:58:54,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:58:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-18 17:58:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-18 17:58:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-18 17:58:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-18 17:58:54,888 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-18 17:58:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:54,889 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-18 17:58:54,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:58:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-18 17:58:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-18 17:58:54,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:54,890 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-18 17:58:54,890 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-18 17:58:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:54,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:54,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:55,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:55,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:55,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:55,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:55,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:55,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:55,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:55,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:55,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:55,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:55,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:55,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:55,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:55,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:58:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:56,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:57,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:57,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-18 17:58:57,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:57,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:58:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:58:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-18 17:58:57,583 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-18 17:58:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:58,787 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-18 17:58:58,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:58:58,788 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-18 17:58:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:58,789 INFO L225 Difference]: With dead ends: 150 [2019-01-18 17:58:58,789 INFO L226 Difference]: Without dead ends: 149 [2019-01-18 17:58:58,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:58:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-18 17:58:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-18 17:58:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-18 17:58:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-18 17:58:58,812 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-18 17:58:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:58,812 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-18 17:58:58,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:58:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-18 17:58:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-18 17:58:58,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:58,813 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-18 17:58:58,813 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:58:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-18 17:58:58,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:58,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:58,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:58,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:59,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:59,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:59,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:59,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:59,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:59,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:59,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:59,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:59,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:59,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:58:59,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:59,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:59,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:00,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:01,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:01,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-18 17:59:01,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:01,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:59:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:59:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:59:01,683 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-18 17:59:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:02,851 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-18 17:59:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:59:02,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-18 17:59:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:02,853 INFO L225 Difference]: With dead ends: 155 [2019-01-18 17:59:02,853 INFO L226 Difference]: Without dead ends: 154 [2019-01-18 17:59:02,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:59:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-18 17:59:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-18 17:59:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-18 17:59:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-18 17:59:02,873 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-18 17:59:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:02,874 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-18 17:59:02,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:59:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-18 17:59:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-18 17:59:02,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:02,874 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-18 17:59:02,875 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-18 17:59:02,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:02,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:02,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:03,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:03,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:03,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:03,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:03,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:03,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:03,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:03,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-18 17:59:03,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:03,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:03,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:03,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:03,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:03,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:05,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-18 17:59:06,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:06,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:59:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:59:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 17:59:06,492 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-18 17:59:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:07,756 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-18 17:59:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:59:07,756 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-18 17:59:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:07,757 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:59:07,757 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:59:07,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:59:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:59:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-18 17:59:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-18 17:59:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-18 17:59:07,786 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-18 17:59:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:07,786 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-18 17:59:07,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:59:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-18 17:59:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-18 17:59:07,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:07,787 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-18 17:59:07,788 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:07,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-18 17:59:07,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:07,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:07,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:07,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:07,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:08,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:08,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:08,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:08,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:08,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:08,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:08,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:08,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:08,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:08,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:08,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:08,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:08,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:08,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:09,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:11,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:11,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-18 17:59:11,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:11,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:59:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:59:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:59:11,132 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-18 17:59:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:12,513 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-18 17:59:12,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:59:12,513 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-18 17:59:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:12,514 INFO L225 Difference]: With dead ends: 165 [2019-01-18 17:59:12,514 INFO L226 Difference]: Without dead ends: 164 [2019-01-18 17:59:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:59:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-18 17:59:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-18 17:59:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-18 17:59:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-18 17:59:12,544 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-18 17:59:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:12,544 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-18 17:59:12,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:59:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-18 17:59:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-18 17:59:12,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:12,545 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-18 17:59:12,546 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-18 17:59:12,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:12,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:12,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:13,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:13,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:13,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:13,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:13,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:13,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:13,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:13,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:13,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:13,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:13,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:13,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:14,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:15,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:15,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-18 17:59:15,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:15,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:59:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:59:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 17:59:15,915 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-18 17:59:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:17,755 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-18 17:59:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:59:17,755 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-18 17:59:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:17,756 INFO L225 Difference]: With dead ends: 170 [2019-01-18 17:59:17,757 INFO L226 Difference]: Without dead ends: 169 [2019-01-18 17:59:17,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:59:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-18 17:59:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-18 17:59:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-18 17:59:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-18 17:59:17,787 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-18 17:59:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:17,787 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-18 17:59:17,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:59:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-18 17:59:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-18 17:59:17,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:17,788 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-18 17:59:17,788 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-18 17:59:17,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:17,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:17,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:18,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:18,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:18,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:18,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:18,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:18,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:18,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-18 17:59:18,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:18,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:18,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:18,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:18,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:18,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:19,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:21,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:21,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-18 17:59:21,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:21,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:59:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:59:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:59:21,833 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-18 17:59:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:23,280 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-18 17:59:23,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:59:23,280 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-18 17:59:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:23,281 INFO L225 Difference]: With dead ends: 175 [2019-01-18 17:59:23,281 INFO L226 Difference]: Without dead ends: 174 [2019-01-18 17:59:23,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:59:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-18 17:59:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-18 17:59:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-18 17:59:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-18 17:59:23,318 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-18 17:59:23,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:23,318 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-18 17:59:23,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:59:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-18 17:59:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-18 17:59:23,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:23,319 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-18 17:59:23,319 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-18 17:59:23,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:23,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:23,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:23,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:24,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:24,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:24,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:24,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:24,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:24,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:24,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:24,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:24,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:24,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:24,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:24,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:24,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:25,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:27,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:27,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-18 17:59:27,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:27,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:59:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:59:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-18 17:59:27,490 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-18 17:59:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:29,021 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-18 17:59:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:59:29,021 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-18 17:59:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:29,022 INFO L225 Difference]: With dead ends: 180 [2019-01-18 17:59:29,022 INFO L226 Difference]: Without dead ends: 179 [2019-01-18 17:59:29,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:59:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-18 17:59:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-18 17:59:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-18 17:59:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-18 17:59:29,052 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-18 17:59:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:29,052 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-18 17:59:29,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:59:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-18 17:59:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-18 17:59:29,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:29,053 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-18 17:59:29,054 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-18 17:59:29,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:29,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:29,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:30,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:30,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:30,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:30,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:30,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:30,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:30,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:30,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:30,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:30,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:30,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:30,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:31,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:32,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-18 17:59:32,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:32,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:59:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:59:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:59:32,946 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-18 17:59:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:34,929 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-18 17:59:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:59:34,931 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-18 17:59:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:34,933 INFO L225 Difference]: With dead ends: 185 [2019-01-18 17:59:34,933 INFO L226 Difference]: Without dead ends: 184 [2019-01-18 17:59:34,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:59:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-18 17:59:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-18 17:59:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-18 17:59:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-18 17:59:34,972 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-18 17:59:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:34,972 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-18 17:59:34,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:59:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-18 17:59:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-18 17:59:34,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:34,974 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-18 17:59:34,974 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-18 17:59:34,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:34,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:34,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:36,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:36,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:36,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:36,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:36,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:36,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:36,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:36,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-18 17:59:36,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:36,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:36,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:36,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:37,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:37,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:38,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-18 17:59:40,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:59:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:59:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-18 17:59:40,154 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-18 17:59:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:41,743 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-18 17:59:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:59:41,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-18 17:59:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:41,744 INFO L225 Difference]: With dead ends: 190 [2019-01-18 17:59:41,744 INFO L226 Difference]: Without dead ends: 189 [2019-01-18 17:59:41,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:59:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-18 17:59:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-18 17:59:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-18 17:59:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-18 17:59:41,781 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-18 17:59:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:41,782 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-18 17:59:41,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:59:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-18 17:59:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-18 17:59:41,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:41,783 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-18 17:59:41,783 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-18 17:59:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:41,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:41,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:42,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:42,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:42,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:42,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:42,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:42,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:42,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:42,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:42,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:42,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:42,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:42,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:42,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:43,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:43,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:44,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:47,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:47,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-18 17:59:47,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:47,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:59:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:59:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:59:47,153 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-18 17:59:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:48,907 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-18 17:59:48,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:59:48,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-18 17:59:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:48,908 INFO L225 Difference]: With dead ends: 195 [2019-01-18 17:59:48,909 INFO L226 Difference]: Without dead ends: 194 [2019-01-18 17:59:48,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:59:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-18 17:59:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-18 17:59:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-18 17:59:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-18 17:59:48,938 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-18 17:59:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:48,939 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-18 17:59:48,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:59:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-18 17:59:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-18 17:59:48,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:48,940 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-18 17:59:48,940 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-18 17:59:48,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:48,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:48,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:49,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:49,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:49,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:49,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:49,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:49,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:49,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:49,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:49,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:49,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:50,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:50,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:51,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:53,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:53,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-18 17:59:53,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:53,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:59:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:59:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-18 17:59:53,252 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-18 17:59:53,859 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:59:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:55,831 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-18 17:59:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:59:55,832 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-18 17:59:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:55,833 INFO L225 Difference]: With dead ends: 200 [2019-01-18 17:59:55,833 INFO L226 Difference]: Without dead ends: 199 [2019-01-18 17:59:55,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:59:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-18 17:59:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-18 17:59:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-18 17:59:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-18 17:59:55,871 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-18 17:59:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-18 17:59:55,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:59:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-18 17:59:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-18 17:59:55,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:55,873 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-18 17:59:55,873 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:59:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-18 17:59:55,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:55,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:55,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:56,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:56,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:56,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:56,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:56,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:56,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:56,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:56,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:57,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-18 17:59:57,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:57,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:57,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 17:59:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:57,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:57,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:59:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:58,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:00,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-18 18:00:00,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:00,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 18:00:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 18:00:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 18:00:00,682 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-18 18:00:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:02,618 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-18 18:00:02,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 18:00:02,619 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-18 18:00:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:02,620 INFO L225 Difference]: With dead ends: 205 [2019-01-18 18:00:02,620 INFO L226 Difference]: Without dead ends: 204 [2019-01-18 18:00:02,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 18:00:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-18 18:00:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-18 18:00:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-18 18:00:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-18 18:00:02,649 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-18 18:00:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:02,650 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-18 18:00:02,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 18:00:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-18 18:00:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-18 18:00:02,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:02,651 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-18 18:00:02,651 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-18 18:00:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:02,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:02,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:03,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:03,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:03,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:03,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:03,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:03,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:03,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:03,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:03,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:03,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:03,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:03,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:03,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:03,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:04,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:07,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-18 18:00:07,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:07,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 18:00:07,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 18:00:07,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-18 18:00:07,308 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-18 18:00:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:09,181 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-18 18:00:09,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 18:00:09,181 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-18 18:00:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:09,182 INFO L225 Difference]: With dead ends: 210 [2019-01-18 18:00:09,182 INFO L226 Difference]: Without dead ends: 209 [2019-01-18 18:00:09,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 18:00:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-18 18:00:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-18 18:00:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-18 18:00:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-18 18:00:09,219 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-18 18:00:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:09,220 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-18 18:00:09,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 18:00:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-18 18:00:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-18 18:00:09,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:09,221 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-18 18:00:09,221 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-18 18:00:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:09,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:09,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:10,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:10,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:10,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:10,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:10,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:10,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:10,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:10,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:10,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:10,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:10,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:11,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:14,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:14,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-18 18:00:14,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:14,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 18:00:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 18:00:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 18:00:14,407 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-18 18:00:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:16,585 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-18 18:00:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 18:00:16,586 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-18 18:00:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:16,587 INFO L225 Difference]: With dead ends: 215 [2019-01-18 18:00:16,587 INFO L226 Difference]: Without dead ends: 214 [2019-01-18 18:00:16,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 18:00:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-18 18:00:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-18 18:00:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-18 18:00:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-18 18:00:16,622 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-18 18:00:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:16,622 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-18 18:00:16,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 18:00:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-18 18:00:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-18 18:00:16,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:16,623 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-18 18:00:16,623 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-18 18:00:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:16,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:18,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:18,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:18,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:18,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:18,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:18,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:18,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:18,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:18,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-18 18:00:18,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:18,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:18,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:18,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:18,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:18,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:20,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:22,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:22,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-18 18:00:22,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:22,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 18:00:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 18:00:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-18 18:00:22,727 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-18 18:00:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:24,751 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-18 18:00:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 18:00:24,751 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-18 18:00:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:24,752 INFO L225 Difference]: With dead ends: 220 [2019-01-18 18:00:24,752 INFO L226 Difference]: Without dead ends: 219 [2019-01-18 18:00:24,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 18:00:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-18 18:00:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-18 18:00:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-18 18:00:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-18 18:00:24,788 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-18 18:00:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:24,788 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-18 18:00:24,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 18:00:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-18 18:00:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-18 18:00:24,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:24,789 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-18 18:00:24,789 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-18 18:00:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:24,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:24,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:26,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:26,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:26,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:26,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:26,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:26,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:26,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:26,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:26,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:26,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:26,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:26,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:26,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:26,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:26,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:27,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:30,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:30,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-18 18:00:30,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:30,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 18:00:30,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 18:00:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 18:00:30,163 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-18 18:00:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:32,436 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-18 18:00:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 18:00:32,437 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-18 18:00:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:32,438 INFO L225 Difference]: With dead ends: 225 [2019-01-18 18:00:32,438 INFO L226 Difference]: Without dead ends: 224 [2019-01-18 18:00:32,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:00:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-18 18:00:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-18 18:00:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-18 18:00:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-18 18:00:32,474 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-18 18:00:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:32,474 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-18 18:00:32,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 18:00:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-18 18:00:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-18 18:00:32,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:32,475 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-18 18:00:32,475 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-18 18:00:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:32,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:32,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:33,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:33,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:33,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:33,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:33,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:33,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:33,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:33,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:33,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:33,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:33,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:33,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:35,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-18 18:00:37,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:37,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 18:00:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 18:00:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-18 18:00:37,955 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-18 18:00:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:40,272 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-18 18:00:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 18:00:40,273 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-18 18:00:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:40,274 INFO L225 Difference]: With dead ends: 230 [2019-01-18 18:00:40,274 INFO L226 Difference]: Without dead ends: 229 [2019-01-18 18:00:40,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 18:00:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-18 18:00:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-18 18:00:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-18 18:00:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-18 18:00:40,323 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-18 18:00:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:40,323 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-18 18:00:40,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 18:00:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-18 18:00:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-18 18:00:40,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:40,325 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-18 18:00:40,325 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-18 18:00:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:40,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:40,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:42,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:42,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:42,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:42,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:42,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:42,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:42,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:42,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-18 18:00:42,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:42,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:42,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:42,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:42,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:42,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:43,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:47,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-18 18:00:47,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 18:00:47,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 18:00:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 18:00:47,071 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-18 18:00:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:49,433 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-18 18:00:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 18:00:49,433 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-18 18:00:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:49,434 INFO L225 Difference]: With dead ends: 235 [2019-01-18 18:00:49,434 INFO L226 Difference]: Without dead ends: 234 [2019-01-18 18:00:49,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:00:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-18 18:00:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-18 18:00:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-18 18:00:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-18 18:00:49,496 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-18 18:00:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:49,496 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-18 18:00:49,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 18:00:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-18 18:00:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-18 18:00:49,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:49,498 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-18 18:00:49,498 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-18 18:00:49,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:49,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:49,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:50,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:50,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:50,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:50,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:50,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:50,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:51,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:51,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:51,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:51,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:51,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:51,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:51,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:00:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:52,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:55,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:55,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-18 18:00:55,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:55,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 18:00:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 18:00:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-18 18:00:55,494 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-18 18:00:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:58,109 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-18 18:00:58,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 18:00:58,109 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-18 18:00:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:58,110 INFO L225 Difference]: With dead ends: 240 [2019-01-18 18:00:58,110 INFO L226 Difference]: Without dead ends: 239 [2019-01-18 18:00:58,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:00:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-18 18:00:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-18 18:00:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-18 18:00:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-18 18:00:58,170 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-18 18:00:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:58,170 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-18 18:00:58,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 18:00:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-18 18:00:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-18 18:00:58,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:58,172 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-18 18:00:58,172 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:00:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-18 18:00:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:58,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:58,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:59,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:59,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:59,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:59,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:59,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:59,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:59,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:59,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:59,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:59,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:00:59,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:59,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:59,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:01,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:04,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:04,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-18 18:01:04,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:04,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 18:01:04,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 18:01:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 18:01:04,644 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-18 18:01:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:07,462 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-18 18:01:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 18:01:07,469 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-18 18:01:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:07,470 INFO L225 Difference]: With dead ends: 245 [2019-01-18 18:01:07,470 INFO L226 Difference]: Without dead ends: 244 [2019-01-18 18:01:07,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:01:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-18 18:01:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-18 18:01:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-18 18:01:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-18 18:01:07,527 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-18 18:01:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:07,527 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-18 18:01:07,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 18:01:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-18 18:01:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-18 18:01:07,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:07,528 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-18 18:01:07,528 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-18 18:01:07,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:07,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:07,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:07,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:07,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:08,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:08,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:08,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:08,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:08,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:08,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:08,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:09,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-18 18:01:09,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:09,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:09,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:09,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:09,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:09,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:10,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:14,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:14,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-18 18:01:14,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:14,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 18:01:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 18:01:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-18 18:01:14,225 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-18 18:01:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:16,830 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-18 18:01:16,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 18:01:16,830 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-18 18:01:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:16,832 INFO L225 Difference]: With dead ends: 250 [2019-01-18 18:01:16,832 INFO L226 Difference]: Without dead ends: 249 [2019-01-18 18:01:16,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:01:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-18 18:01:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-18 18:01:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-18 18:01:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-18 18:01:16,888 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-18 18:01:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:16,888 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-18 18:01:16,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 18:01:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-18 18:01:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-18 18:01:16,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:16,889 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-18 18:01:16,889 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-18 18:01:16,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:16,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:16,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:18,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:18,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:18,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:18,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:18,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:18,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:18,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:18,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:18,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:18,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:20,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:23,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:23,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-18 18:01:23,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:23,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 18:01:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 18:01:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 18:01:23,607 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-18 18:01:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:26,272 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-18 18:01:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 18:01:26,272 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-18 18:01:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:26,274 INFO L225 Difference]: With dead ends: 255 [2019-01-18 18:01:26,274 INFO L226 Difference]: Without dead ends: 254 [2019-01-18 18:01:26,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:01:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-18 18:01:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-18 18:01:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-18 18:01:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-18 18:01:26,358 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-18 18:01:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:26,359 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-18 18:01:26,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 18:01:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-18 18:01:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-18 18:01:26,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:26,360 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-18 18:01:26,361 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-18 18:01:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:26,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:26,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:27,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:27,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:27,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:27,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:27,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:27,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:27,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:27,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:28,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:28,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:28,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:28,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:28,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:29,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:33,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:33,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-18 18:01:33,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:33,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 18:01:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 18:01:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-18 18:01:33,382 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-18 18:01:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:36,110 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-18 18:01:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 18:01:36,111 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-18 18:01:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:36,112 INFO L225 Difference]: With dead ends: 260 [2019-01-18 18:01:36,112 INFO L226 Difference]: Without dead ends: 259 [2019-01-18 18:01:36,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:01:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-18 18:01:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-18 18:01:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-18 18:01:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-18 18:01:36,171 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-18 18:01:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:36,171 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-18 18:01:36,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 18:01:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-18 18:01:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-18 18:01:36,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:36,173 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-18 18:01:36,173 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-18 18:01:36,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:36,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:38,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:38,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:38,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:38,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:38,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:38,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:38,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:38,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:38,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-18 18:01:38,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:38,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:38,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:38,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:38,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:38,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:40,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:43,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:43,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-18 18:01:43,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:43,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 18:01:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 18:01:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 18:01:43,923 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-18 18:01:46,292 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:01:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:47,471 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-18 18:01:47,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 18:01:47,472 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-18 18:01:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:47,473 INFO L225 Difference]: With dead ends: 265 [2019-01-18 18:01:47,473 INFO L226 Difference]: Without dead ends: 264 [2019-01-18 18:01:47,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:01:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-18 18:01:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-18 18:01:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-18 18:01:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-18 18:01:47,526 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-18 18:01:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:47,526 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-18 18:01:47,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 18:01:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-18 18:01:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-18 18:01:47,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:47,528 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-18 18:01:47,528 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-18 18:01:47,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:47,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:47,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:49,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:49,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:49,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:49,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:49,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:49,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:49,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:49,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:49,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:49,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:49,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:49,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:01:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:51,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:54,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:54,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-18 18:01:54,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:54,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-18 18:01:54,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-18 18:01:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 18:01:54,929 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-18 18:01:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:57,846 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-18 18:01:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 18:01:57,846 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-18 18:01:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:57,847 INFO L225 Difference]: With dead ends: 270 [2019-01-18 18:01:57,848 INFO L226 Difference]: Without dead ends: 269 [2019-01-18 18:01:57,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:01:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-18 18:01:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-18 18:01:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-18 18:01:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-18 18:01:57,908 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-18 18:01:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:57,909 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-18 18:01:57,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-18 18:01:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-18 18:01:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-18 18:01:57,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:57,910 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-18 18:01:57,910 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:01:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-18 18:01:57,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:57,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:57,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:59,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:59,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:59,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:59,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:59,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:59,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:59,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:59,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:59,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:01:59,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:59,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:59,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:01,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:05,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:05,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-18 18:02:05,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:05,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-18 18:02:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-18 18:02:05,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 18:02:05,260 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-18 18:02:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:08,247 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-18 18:02:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 18:02:08,247 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-18 18:02:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:08,248 INFO L225 Difference]: With dead ends: 275 [2019-01-18 18:02:08,249 INFO L226 Difference]: Without dead ends: 274 [2019-01-18 18:02:08,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:02:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-18 18:02:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-18 18:02:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-18 18:02:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-18 18:02:08,305 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-18 18:02:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:08,305 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-18 18:02:08,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-18 18:02:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-18 18:02:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-18 18:02:08,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:08,307 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-18 18:02:08,307 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:02:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-18 18:02:08,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:08,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:08,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:08,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:09,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:09,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:09,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:09,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:09,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:09,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:09,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:10,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-18 18:02:10,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:10,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:10,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:02:10,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:10,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:10,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:12,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:15,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:15,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-18 18:02:15,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:15,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 18:02:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 18:02:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-18 18:02:15,995 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-18 18:02:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:19,174 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-18 18:02:19,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 18:02:19,174 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-18 18:02:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:19,175 INFO L225 Difference]: With dead ends: 280 [2019-01-18 18:02:19,176 INFO L226 Difference]: Without dead ends: 279 [2019-01-18 18:02:19,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 18:02:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-18 18:02:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-18 18:02:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-18 18:02:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-18 18:02:19,239 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-18 18:02:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:19,240 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-18 18:02:19,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 18:02:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-18 18:02:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-18 18:02:19,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:19,241 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-18 18:02:19,242 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:02:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-18 18:02:19,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:19,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:19,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:20,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:20,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:20,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:20,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:20,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:20,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:21,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:21,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:21,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:21,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:02:21,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:21,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:21,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:22,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:26,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:26,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-18 18:02:26,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:26,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-18 18:02:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-18 18:02:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 18:02:26,750 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-18 18:02:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:30,005 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-18 18:02:30,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 18:02:30,005 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-18 18:02:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:30,006 INFO L225 Difference]: With dead ends: 285 [2019-01-18 18:02:30,006 INFO L226 Difference]: Without dead ends: 284 [2019-01-18 18:02:30,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 18:02:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-18 18:02:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-18 18:02:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-18 18:02:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-18 18:02:30,064 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-18 18:02:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:30,064 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-18 18:02:30,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-18 18:02:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-18 18:02:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-18 18:02:30,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:30,065 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-18 18:02:30,066 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:02:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-18 18:02:30,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:30,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:30,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:31,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:31,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:31,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:31,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:31,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:31,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:31,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:31,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:31,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:31,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:02:31,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:31,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:31,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:33,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:37,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-18 18:02:37,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:37,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-18 18:02:37,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-18 18:02:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-18 18:02:37,795 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-18 18:02:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:41,208 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-18 18:02:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 18:02:41,208 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-18 18:02:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:41,210 INFO L225 Difference]: With dead ends: 290 [2019-01-18 18:02:41,210 INFO L226 Difference]: Without dead ends: 289 [2019-01-18 18:02:41,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 18:02:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-18 18:02:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-18 18:02:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-18 18:02:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-18 18:02:41,267 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-18 18:02:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:41,267 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-18 18:02:41,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-18 18:02:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-18 18:02:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-18 18:02:41,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:41,269 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-18 18:02:41,269 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:02:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-18 18:02:41,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:41,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:41,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:42,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:42,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:42,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:42,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:42,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:42,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:42,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:42,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:43,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-18 18:02:43,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:43,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:43,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:02:43,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:43,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:43,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:45,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:49,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:49,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-18 18:02:49,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:49,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-18 18:02:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-18 18:02:49,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 18:02:49,679 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-18 18:02:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:53,056 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-18 18:02:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 18:02:53,057 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-18 18:02:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:53,058 INFO L225 Difference]: With dead ends: 295 [2019-01-18 18:02:53,058 INFO L226 Difference]: Without dead ends: 294 [2019-01-18 18:02:53,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 18:02:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-18 18:02:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-18 18:02:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-18 18:02:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-18 18:02:53,119 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-18 18:02:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:53,119 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-18 18:02:53,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-18 18:02:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-18 18:02:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-18 18:02:53,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:53,121 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-18 18:02:53,121 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:02:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-18 18:02:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:53,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:53,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:55,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:55,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:55,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:55,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:55,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:55,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:55,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:55,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:55,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:55,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:55,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:02:55,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:55,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:55,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:02:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:57,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:01,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:01,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-18 18:03:01,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:01,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-18 18:03:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-18 18:03:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 18:03:01,324 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-18 18:03:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:04,851 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-18 18:03:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 18:03:04,851 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-18 18:03:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:04,852 INFO L225 Difference]: With dead ends: 300 [2019-01-18 18:03:04,852 INFO L226 Difference]: Without dead ends: 299 [2019-01-18 18:03:04,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 18:03:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-18 18:03:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-18 18:03:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-18 18:03:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-18 18:03:04,923 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-18 18:03:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:04,923 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-18 18:03:04,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-18 18:03:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-18 18:03:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-18 18:03:04,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:04,925 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-18 18:03:04,925 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:03:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-18 18:03:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:04,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:04,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:06,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:06,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:06,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:06,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:06,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:06,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:06,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:06,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:06,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:03:06,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:06,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:06,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:03:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:09,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-18 18:03:13,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:13,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-18 18:03:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-18 18:03:13,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 18:03:13,372 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-18 18:03:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:17,117 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-18 18:03:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 18:03:17,117 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-18 18:03:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:17,118 INFO L225 Difference]: With dead ends: 305 [2019-01-18 18:03:17,119 INFO L226 Difference]: Without dead ends: 304 [2019-01-18 18:03:17,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 18:03:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-18 18:03:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-18 18:03:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-18 18:03:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-18 18:03:17,183 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-18 18:03:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:17,183 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-18 18:03:17,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-18 18:03:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-18 18:03:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-18 18:03:17,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:17,184 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-18 18:03:17,185 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:03:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-18 18:03:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:17,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:17,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:17,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:17,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:18,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:18,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:18,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:18,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:18,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:18,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:18,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:18,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:19,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-18 18:03:19,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:19,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:19,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:03:19,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:19,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:19,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:03:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:21,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:26,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:26,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-18 18:03:26,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:26,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-18 18:03:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-18 18:03:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-18 18:03:26,006 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-18 18:03:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:29,645 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-18 18:03:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 18:03:29,645 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-18 18:03:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:29,646 INFO L225 Difference]: With dead ends: 310 [2019-01-18 18:03:29,647 INFO L226 Difference]: Without dead ends: 309 [2019-01-18 18:03:29,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-18 18:03:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-18 18:03:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-18 18:03:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-18 18:03:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-18 18:03:29,715 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-18 18:03:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:29,715 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-18 18:03:29,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-18 18:03:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-18 18:03:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-18 18:03:29,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:29,716 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-18 18:03:29,716 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:03:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-18 18:03:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:29,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:29,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:29,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:32,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:32,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:32,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:32,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:32,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:32,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:32,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:03:32,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:03:32,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:03:32,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:32,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:32,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:03:32,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:32,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:32,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:03:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:34,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:38,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:38,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-18 18:03:38,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:38,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-18 18:03:38,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-18 18:03:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 18:03:38,794 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-18 18:03:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:42,832 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-18 18:03:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 18:03:42,832 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-18 18:03:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:42,834 INFO L225 Difference]: With dead ends: 315 [2019-01-18 18:03:42,834 INFO L226 Difference]: Without dead ends: 314 [2019-01-18 18:03:42,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-18 18:03:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-18 18:03:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-18 18:03:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-18 18:03:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-18 18:03:42,915 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-18 18:03:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:42,916 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-18 18:03:42,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-18 18:03:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-18 18:03:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-18 18:03:42,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:42,917 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-18 18:03:42,917 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:03:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-18 18:03:42,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:42,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:42,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:42,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:42,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:44,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:44,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:44,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:44,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:44,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:44,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:44,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:45,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:45,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:03:45,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:45,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:45,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:03:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:47,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:51,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:51,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-18 18:03:51,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:51,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-18 18:03:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-18 18:03:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-18 18:03:51,936 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-18 18:03:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:56,116 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-18 18:03:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 18:03:56,117 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-18 18:03:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:56,118 INFO L225 Difference]: With dead ends: 320 [2019-01-18 18:03:56,118 INFO L226 Difference]: Without dead ends: 319 [2019-01-18 18:03:56,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-18 18:03:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-18 18:03:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-18 18:03:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-18 18:03:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-18 18:03:56,189 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-18 18:03:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:56,189 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-18 18:03:56,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-18 18:03:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-18 18:03:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-18 18:03:56,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:56,191 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-18 18:03:56,191 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:03:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-18 18:03:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:56,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:56,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:58,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:58,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:58,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:58,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:58,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:58,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:58,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:58,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:58,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-18 18:03:58,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:58,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:58,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:03:58,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:58,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:58,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:04:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:01,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:05,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:05,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-18 18:04:05,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:05,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-18 18:04:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-18 18:04:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 18:04:05,335 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-18 18:04:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:09,360 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-18 18:04:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 18:04:09,361 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-18 18:04:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:09,362 INFO L225 Difference]: With dead ends: 325 [2019-01-18 18:04:09,362 INFO L226 Difference]: Without dead ends: 324 [2019-01-18 18:04:09,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-18 18:04:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-18 18:04:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-18 18:04:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-18 18:04:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-18 18:04:09,438 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-18 18:04:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:09,438 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-18 18:04:09,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-18 18:04:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-18 18:04:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-18 18:04:09,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:09,439 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-18 18:04:09,440 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:04:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-18 18:04:09,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:09,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:09,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:09,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:09,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:11,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:11,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:11,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:11,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:11,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:11,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:11,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:11,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:11,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:11,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:11,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:04:11,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:12,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:12,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:04:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:14,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-18 18:04:18,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-18 18:04:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-18 18:04:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 18:04:18,722 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-18 18:04:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:22,941 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-18 18:04:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 18:04:22,942 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-18 18:04:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:22,943 INFO L225 Difference]: With dead ends: 330 [2019-01-18 18:04:22,943 INFO L226 Difference]: Without dead ends: 329 [2019-01-18 18:04:22,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-18 18:04:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-18 18:04:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-18 18:04:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-18 18:04:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-18 18:04:23,021 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-18 18:04:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:23,022 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-18 18:04:23,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-18 18:04:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-18 18:04:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-18 18:04:23,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:23,023 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-18 18:04:23,023 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:04:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-18 18:04:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:23,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:23,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:25,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:25,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:25,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:25,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:25,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:25,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:25,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:04:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:25,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:25,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:04:25,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:25,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:25,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:04:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:28,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-18 18:04:32,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:32,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-18 18:04:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-18 18:04:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 18:04:32,363 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-18 18:04:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:36,522 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-18 18:04:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 18:04:36,522 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-18 18:04:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:36,524 INFO L225 Difference]: With dead ends: 335 [2019-01-18 18:04:36,524 INFO L226 Difference]: Without dead ends: 334 [2019-01-18 18:04:36,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-18 18:04:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-18 18:04:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-18 18:04:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-18 18:04:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-18 18:04:36,604 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-18 18:04:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:36,604 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-18 18:04:36,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-18 18:04:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-18 18:04:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-18 18:04:36,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:36,605 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-18 18:04:36,606 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:04:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-18 18:04:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:36,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:38,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:38,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:38,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:38,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:38,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:38,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:38,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:38,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:39,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-18 18:04:39,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:39,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:39,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:04:39,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:39,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:39,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:04:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:42,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:46,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-18 18:04:46,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:46,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-18 18:04:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-18 18:04:46,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-18 18:04:46,296 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-18 18:04:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:50,718 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-18 18:04:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 18:04:50,718 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-18 18:04:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:50,719 INFO L225 Difference]: With dead ends: 340 [2019-01-18 18:04:50,719 INFO L226 Difference]: Without dead ends: 339 [2019-01-18 18:04:50,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-18 18:04:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-18 18:04:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-18 18:04:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-18 18:04:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-18 18:04:50,800 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-18 18:04:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-18 18:04:50,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-18 18:04:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-18 18:04:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-18 18:04:50,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:50,801 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-18 18:04:50,802 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:04:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-18 18:04:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:50,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:50,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:53,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:53,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:53,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:53,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:53,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:53,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:53,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:53,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:53,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:53,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:53,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:53,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:04:53,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:53,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:53,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:04:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:56,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:00,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-18 18:05:00,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-18 18:05:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-18 18:05:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 18:05:00,733 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-18 18:05:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:05,375 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-18 18:05:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 18:05:05,375 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-18 18:05:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:05,376 INFO L225 Difference]: With dead ends: 345 [2019-01-18 18:05:05,376 INFO L226 Difference]: Without dead ends: 344 [2019-01-18 18:05:05,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-18 18:05:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-18 18:05:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-18 18:05:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-18 18:05:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-18 18:05:05,473 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-18 18:05:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:05,474 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-18 18:05:05,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-18 18:05:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-18 18:05:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-18 18:05:05,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:05,475 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-18 18:05:05,475 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:05:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-18 18:05:05,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:05,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:05,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:05,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:05,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:08,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:08,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:08,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:08,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:08,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:08,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:08,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:05:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:08,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:08,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:05:08,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:08,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:08,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:05:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:11,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:15,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-18 18:05:15,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:15,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-18 18:05:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-18 18:05:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-18 18:05:15,553 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-18 18:05:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:20,354 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-18 18:05:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 18:05:20,354 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-18 18:05:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:20,356 INFO L225 Difference]: With dead ends: 350 [2019-01-18 18:05:20,356 INFO L226 Difference]: Without dead ends: 349 [2019-01-18 18:05:20,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-18 18:05:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-18 18:05:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-18 18:05:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-18 18:05:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-18 18:05:20,443 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-18 18:05:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:20,443 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-18 18:05:20,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-18 18:05:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-18 18:05:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-18 18:05:20,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:20,445 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-18 18:05:20,445 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:05:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-18 18:05:20,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:20,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:20,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:22,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:22,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:22,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:22,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:22,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:22,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:22,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:05:22,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:05:23,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-18 18:05:23,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:23,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:23,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:05:23,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:23,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:23,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:05:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:26,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:30,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:30,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-18 18:05:30,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:30,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-18 18:05:30,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-18 18:05:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 18:05:30,627 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-18 18:05:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:35,494 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-18 18:05:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 18:05:35,495 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-18 18:05:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:35,496 INFO L225 Difference]: With dead ends: 355 [2019-01-18 18:05:35,496 INFO L226 Difference]: Without dead ends: 354 [2019-01-18 18:05:35,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-18 18:05:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-18 18:05:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-18 18:05:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-18 18:05:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-18 18:05:35,584 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-18 18:05:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:35,585 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-18 18:05:35,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-18 18:05:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-18 18:05:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-18 18:05:35,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:35,586 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-18 18:05:35,586 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:05:35,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-18 18:05:35,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:35,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:35,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:37,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:37,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:37,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:37,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:37,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:37,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:38,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:38,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:38,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:38,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:38,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:05:38,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:38,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:38,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:05:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:41,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:45,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:45,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-18 18:05:45,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:45,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-18 18:05:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-18 18:05:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 18:05:45,961 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-18 18:05:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:50,944 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-18 18:05:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 18:05:50,945 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-18 18:05:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:50,946 INFO L225 Difference]: With dead ends: 360 [2019-01-18 18:05:50,946 INFO L226 Difference]: Without dead ends: 359 [2019-01-18 18:05:50,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-18 18:05:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-18 18:05:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-18 18:05:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-18 18:05:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-18 18:05:51,041 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-18 18:05:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:51,041 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-18 18:05:51,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-18 18:05:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-18 18:05:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-18 18:05:51,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:51,042 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-18 18:05:51,043 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:05:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-18 18:05:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:51,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:51,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:53,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:53,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:53,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:53,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:53,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:53,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:53,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:05:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:53,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:53,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:05:53,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:53,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:53,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:05:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:56,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-18 18:06:01,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:01,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-18 18:06:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-18 18:06:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 18:06:01,020 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-18 18:06:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:06,013 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-18 18:06:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 18:06:06,014 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-18 18:06:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:06,015 INFO L225 Difference]: With dead ends: 365 [2019-01-18 18:06:06,015 INFO L226 Difference]: Without dead ends: 364 [2019-01-18 18:06:06,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-18 18:06:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-18 18:06:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-18 18:06:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-18 18:06:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-18 18:06:06,107 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-18 18:06:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:06,108 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-18 18:06:06,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-18 18:06:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-18 18:06:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-18 18:06:06,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:06,109 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-18 18:06:06,109 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:06:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-18 18:06:06,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:06,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:06:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:06,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:08,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:08,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:08,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:08,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:08,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:08,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:06:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:06:08,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:06:09,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-18 18:06:09,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:06:09,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:09,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:06:09,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:06:09,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:06:09,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:06:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:12,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:16,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:16,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-18 18:06:16,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:16,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-18 18:06:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-18 18:06:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-18 18:06:16,757 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-18 18:06:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:21,848 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-18 18:06:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 18:06:21,848 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-18 18:06:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:21,850 INFO L225 Difference]: With dead ends: 370 [2019-01-18 18:06:21,850 INFO L226 Difference]: Without dead ends: 369 [2019-01-18 18:06:21,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-18 18:06:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-18 18:06:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-18 18:06:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-18 18:06:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-18 18:06:21,948 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-18 18:06:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:21,948 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-18 18:06:21,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-18 18:06:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-18 18:06:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-18 18:06:21,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:21,950 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-18 18:06:21,950 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:06:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-18 18:06:21,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:21,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:06:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:21,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:24,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:24,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:24,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:24,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:24,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:24,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:06:24,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:06:24,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:06:25,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:06:25,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:06:25,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:25,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:06:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:06:25,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:06:25,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:06:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:28,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:32,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:32,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-18 18:06:32,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:32,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-18 18:06:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-18 18:06:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:06:32,848 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-18 18:06:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:38,072 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-18 18:06:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 18:06:38,072 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-18 18:06:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:38,074 INFO L225 Difference]: With dead ends: 375 [2019-01-18 18:06:38,074 INFO L226 Difference]: Without dead ends: 374 [2019-01-18 18:06:38,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-18 18:06:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-18 18:06:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-18 18:06:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-18 18:06:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-18 18:06:38,173 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-18 18:06:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:38,173 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-18 18:06:38,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-18 18:06:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-18 18:06:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-18 18:06:38,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:38,175 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-18 18:06:38,175 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:06:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-18 18:06:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:38,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:06:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:38,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:41,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:41,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:41,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:41,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:41,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:06:41,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:06:41,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:06:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:41,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:41,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:06:41,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:06:41,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:06:41,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:06:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:44,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:06:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:06:48,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-18 18:06:48,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:06:48,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-18 18:06:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-18 18:06:48,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-18 18:06:48,936 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-18 18:06:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:06:54,523 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-18 18:06:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 18:06:54,523 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-18 18:06:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:06:54,525 INFO L225 Difference]: With dead ends: 380 [2019-01-18 18:06:54,525 INFO L226 Difference]: Without dead ends: 379 [2019-01-18 18:06:54,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-18 18:06:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-18 18:06:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-18 18:06:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-18 18:06:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-18 18:06:54,626 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-18 18:06:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:06:54,626 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-18 18:06:54,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-18 18:06:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-18 18:06:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-18 18:06:54,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:06:54,628 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-18 18:06:54,628 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:06:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:06:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-18 18:06:54,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:06:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:06:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:06:54,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:06:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:06:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:06:57,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:57,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:06:57,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:06:57,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:06:57,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:06:57,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:06:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:06:57,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:06:58,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-18 18:06:58,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:06:58,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:06:58,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:06:58,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:06:58,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:06:58,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:07:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:01,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:06,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:06,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-18 18:07:06,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:06,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-18 18:07:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-18 18:07:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 18:07:06,504 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-18 18:07:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:12,058 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-18 18:07:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 18:07:12,058 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-18 18:07:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:12,060 INFO L225 Difference]: With dead ends: 385 [2019-01-18 18:07:12,060 INFO L226 Difference]: Without dead ends: 384 [2019-01-18 18:07:12,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-18 18:07:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-18 18:07:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-18 18:07:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-18 18:07:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-18 18:07:12,165 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-18 18:07:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:12,166 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-18 18:07:12,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-18 18:07:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-18 18:07:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-18 18:07:12,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:12,167 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-18 18:07:12,168 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:07:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-18 18:07:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:12,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:07:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:12,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:14,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:14,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:14,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:07:14,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:07:14,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:14,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:07:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:07:14,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:07:15,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:07:15,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:07:15,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:15,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:07:15,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:15,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:15,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:07:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:18,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:23,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-18 18:07:23,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:23,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-18 18:07:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-18 18:07:23,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 18:07:23,582 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-18 18:07:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:29,279 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-18 18:07:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 18:07:29,280 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-18 18:07:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:29,281 INFO L225 Difference]: With dead ends: 390 [2019-01-18 18:07:29,281 INFO L226 Difference]: Without dead ends: 389 [2019-01-18 18:07:29,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-18 18:07:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-18 18:07:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-18 18:07:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-18 18:07:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-18 18:07:29,389 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-18 18:07:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:29,389 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-18 18:07:29,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-18 18:07:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-18 18:07:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-18 18:07:29,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:29,391 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-18 18:07:29,391 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:07:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:29,391 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-18 18:07:29,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:29,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:07:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:29,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:32,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:32,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:32,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:07:32,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:07:32,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:32,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:07:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:32,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:32,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:32,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:07:32,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:32,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:32,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:07:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:36,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:40,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:40,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-18 18:07:40,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:40,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-18 18:07:40,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-18 18:07:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 18:07:40,964 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-18 18:07:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:46,919 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-18 18:07:46,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 18:07:46,923 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-18 18:07:46,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:46,925 INFO L225 Difference]: With dead ends: 395 [2019-01-18 18:07:46,926 INFO L226 Difference]: Without dead ends: 394 [2019-01-18 18:07:46,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-18 18:07:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-18 18:07:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-18 18:07:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-18 18:07:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-18 18:07:47,036 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-18 18:07:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:47,037 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-18 18:07:47,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-18 18:07:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-18 18:07:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-18 18:07:47,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:47,038 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-18 18:07:47,038 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:07:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-18 18:07:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:47,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:47,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:47,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:47,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:50,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:50,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:50,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:07:50,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:07:50,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:50,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:07:50,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:07:50,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:07:50,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-18 18:07:50,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:07:50,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:50,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:07:50,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:07:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:54,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-18 18:07:59,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:59,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-18 18:07:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-18 18:07:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-18 18:07:59,314 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-18 18:08:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:05,295 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-18 18:08:05,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 18:08:05,296 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-18 18:08:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:05,297 INFO L225 Difference]: With dead ends: 400 [2019-01-18 18:08:05,297 INFO L226 Difference]: Without dead ends: 399 [2019-01-18 18:08:05,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-18 18:08:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-18 18:08:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-18 18:08:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-18 18:08:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-18 18:08:05,412 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-18 18:08:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:05,412 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-18 18:08:05,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-18 18:08:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-18 18:08:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-18 18:08:05,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:05,414 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-18 18:08:05,414 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:08:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-18 18:08:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:05,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:05,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:08,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:08,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:08,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:08,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:08,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:08:08,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:08:08,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:08:08,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:08,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:08,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:08:08,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:08:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:12,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:17,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-18 18:08:17,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:17,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-18 18:08:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-18 18:08:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:08:17,661 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-18 18:08:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:23,745 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-18 18:08:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 18:08:23,745 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-18 18:08:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:23,747 INFO L225 Difference]: With dead ends: 405 [2019-01-18 18:08:23,747 INFO L226 Difference]: Without dead ends: 404 [2019-01-18 18:08:23,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-18 18:08:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-18 18:08:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-18 18:08:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-18 18:08:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-18 18:08:23,866 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-18 18:08:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:23,867 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-18 18:08:23,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-18 18:08:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-18 18:08:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-18 18:08:23,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:23,868 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-18 18:08:23,868 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:08:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-18 18:08:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:26,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:26,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:26,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:26,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:26,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:26,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:26,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:26,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:27,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:27,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:08:27,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:08:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:31,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:35,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:35,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-18 18:08:35,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:35,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-18 18:08:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-18 18:08:35,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-18 18:08:35,594 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-18 18:08:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:41,594 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-18 18:08:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 18:08:41,594 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-18 18:08:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:41,596 INFO L225 Difference]: With dead ends: 410 [2019-01-18 18:08:41,596 INFO L226 Difference]: Without dead ends: 409 [2019-01-18 18:08:41,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-18 18:08:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-18 18:08:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-18 18:08:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-18 18:08:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-18 18:08:41,720 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-18 18:08:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:41,721 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-18 18:08:41,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-18 18:08:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-18 18:08:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-18 18:08:41,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:41,722 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-18 18:08:41,723 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:08:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-18 18:08:41,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:41,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:45,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:45,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:45,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:45,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:45,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:45,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:45,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:45,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:46,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-18 18:08:46,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:46,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:46,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:08:46,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:08:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:50,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-18 18:08:54,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:54,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-18 18:08:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-18 18:08:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:08:54,870 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-18 18:09:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:01,355 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-18 18:09:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 18:09:01,355 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-18 18:09:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:01,357 INFO L225 Difference]: With dead ends: 415 [2019-01-18 18:09:01,357 INFO L226 Difference]: Without dead ends: 414 [2019-01-18 18:09:01,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-18 18:09:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-18 18:09:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-18 18:09:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-18 18:09:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-18 18:09:01,481 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-18 18:09:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:01,481 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-18 18:09:01,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-18 18:09:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-18 18:09:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-18 18:09:01,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:01,483 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-18 18:09:01,483 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:09:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-18 18:09:01,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:01,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:01,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:04,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:04,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:04,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:04,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:04,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:09:04,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:09:05,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:09:05,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:05,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:05,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:09:05,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:09:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:09,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-18 18:09:14,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:14,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-18 18:09:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-18 18:09:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 18:09:14,082 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-18 18:09:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:20,575 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-18 18:09:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 18:09:20,575 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-18 18:09:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:20,577 INFO L225 Difference]: With dead ends: 420 [2019-01-18 18:09:20,577 INFO L226 Difference]: Without dead ends: 419 [2019-01-18 18:09:20,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-18 18:09:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-18 18:09:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-18 18:09:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-18 18:09:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-18 18:09:20,704 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-18 18:09:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:20,704 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-18 18:09:20,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-18 18:09:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-18 18:09:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-18 18:09:20,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:20,706 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-18 18:09:20,706 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:09:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-18 18:09:20,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:20,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:20,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:20,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:20,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:24,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:24,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:24,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:24,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:24,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:24,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:24,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:24,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:24,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-18 18:09:24,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:24,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:24,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 18:09:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:28,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:33,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:33,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-18 18:09:33,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:33,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-18 18:09:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-18 18:09:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 18:09:33,109 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-18 18:09:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:39,992 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-18 18:09:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 18:09:39,992 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-18 18:09:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:39,994 INFO L225 Difference]: With dead ends: 425 [2019-01-18 18:09:39,994 INFO L226 Difference]: Without dead ends: 424 [2019-01-18 18:09:39,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-18 18:09:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-18 18:09:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-18 18:09:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-18 18:09:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-18 18:09:40,124 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-18 18:09:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:40,124 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-18 18:09:40,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-18 18:09:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-18 18:09:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-18 18:09:40,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:40,126 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-18 18:09:40,126 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 18:09:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-18 18:09:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:40,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat