java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:27,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:27,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:27,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:27,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:27,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:27,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:27,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:27,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:27,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:27,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:27,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:27,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:27,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:27,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:27,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:27,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:27,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:27,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:27,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:27,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:27,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:27,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:27,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:27,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:27,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:27,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:27,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:27,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:27,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:27,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:27,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:27,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:27,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:27,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:27,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:27,182 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:10:27,203 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:27,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:27,204 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:27,205 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:27,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:27,205 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:27,205 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:27,206 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:27,206 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:27,206 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:27,206 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:27,206 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:27,207 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:27,207 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:27,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:27,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:27,208 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:27,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:27,210 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:27,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:27,212 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:27,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:27,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:27,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:27,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:27,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:27,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:27,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:27,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:27,214 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:27,214 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:27,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:27,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:27,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:27,215 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:27,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:27,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:27,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:27,286 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:27,287 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:27,287 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-02-28 10:10:27,288 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-02-28 10:10:27,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:27,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:27,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:27,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:27,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:27,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,395 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:10:27,396 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:10:27,397 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:10:27,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:27,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:27,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:27,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:27,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/1) ... [2019-02-28 10:10:27,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:27,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:27,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:27,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:27,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-02-28 10:10:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:10:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:10:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-28 10:10:27,848 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:10:27,848 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 10:10:27,850 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:27 BoogieIcfgContainer [2019-02-28 10:10:27,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:27,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:27,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:27,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:27,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:27" (1/2) ... [2019-02-28 10:10:27,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f444cab and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:27, skipping insertion in model container [2019-02-28 10:10:27,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:27" (2/2) ... [2019-02-28 10:10:27,858 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-02-28 10:10:27,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:27,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:10:27,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:10:27,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:27,925 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:27,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:27,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:27,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:27,926 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:27,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:27,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-28 10:10:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:27,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:27,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:27,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-28 10:10:27,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:28,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:28,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:28,199 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-02-28 10:10:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,292 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-02-28 10:10:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:28,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:10:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,306 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:10:28,307 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:10:28,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:10:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-02-28 10:10:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:10:28,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-28 10:10:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,346 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:10:28,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:10:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:28,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:10:28,347 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-02-28 10:10:28,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:28,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:28,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:28,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:28,537 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-02-28 10:10:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,821 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-02-28 10:10:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:28,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:10:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,822 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:28,822 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:10:28,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:10:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-02-28 10:10:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-28 10:10:28,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-02-28 10:10:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,840 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-28 10:10:28,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-28 10:10:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:28,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:28,841 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-02-28 10:10:28,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:28,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:28,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:28,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:28,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:28,893 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-02-28 10:10:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,909 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-02-28 10:10:28,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:28,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-02-28 10:10:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,910 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:28,910 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:28,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:10:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 10:10:28,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-02-28 10:10:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,915 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 10:10:28,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 10:10:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:10:28,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-02-28 10:10:28,916 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:28,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-02-28 10:10:28,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:29,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-28 10:10:29,158 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-02-28 10:10:29,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:29,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:29,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:29,331 INFO L272 AbstractInterpreter]: Visited 7 different actions 25 times. Merged at 6 different actions 18 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:10:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:29,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:29,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:29,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:29,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:10:29,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:29,521 INFO L442 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-02-28 10:10:29,522 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,542 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,543 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:10:29,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:10:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:10:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:10:29,863 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-02-28 10:10:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,112 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:10:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:30,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-02-28 10:10:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,114 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:10:30,114 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:30,115 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-02-28 10:10:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-02-28 10:10:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:10:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:10:30,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-02-28 10:10:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,120 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:10:30,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:10:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:10:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:10:30,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,121 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-02-28 10:10:30,122 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-02-28 10:10:30,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:30,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:30,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:30,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:10:30,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:30,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:30,391 INFO L442 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-02-28 10:10:30,392 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:30,493 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:30,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:10:30,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:10:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:10:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:30,873 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-02-28 10:10:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,071 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-28 10:10:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:31,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-02-28 10:10:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,076 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:10:31,076 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:10:31,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:10:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-02-28 10:10:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:10:31,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-02-28 10:10:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,082 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:10:31,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:10:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:10:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:31,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-02-28 10:10:31,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-02-28 10:10:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:31,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:31,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:31,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:31,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:31,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:31,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:31,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:10:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:31,257 INFO L442 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-02-28 10:10:31,257 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:31,268 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:31,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:31,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:10:31,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:31,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:10:31,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:10:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:10:31,566 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-28 10:10:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,756 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:10:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:31,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-28 10:10:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,760 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:10:31,760 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:31,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-02-28 10:10:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:10:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:10:31,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-02-28 10:10:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,766 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:10:31,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:10:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:10:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:10:31,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,767 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-02-28 10:10:31,767 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-02-28 10:10:31,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:31,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:31,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:31,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:31,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:31,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:31,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:32,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,043 INFO L442 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-02-28 10:10:32,043 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,059 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:32,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:10:32,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:32,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:32,257 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-02-28 10:10:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:32,507 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:10:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:32,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-02-28 10:10:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:32,510 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:32,510 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:10:32,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:10:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-02-28 10:10:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-28 10:10:32,518 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-02-28 10:10:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:32,519 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-28 10:10:32,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-28 10:10:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:32,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:32,520 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-02-28 10:10:32,520 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-02-28 10:10:32,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:32,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:32,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:32,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:32,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:32,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:32,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:10:32,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:32,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,741 INFO L442 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-02-28 10:10:32,742 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,755 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,756 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:33,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-28 10:10:33,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:33,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:10:33,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:10:33,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:10:33,143 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-02-28 10:10:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:33,707 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:10:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:33,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-28 10:10:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:33,708 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:10:33,708 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:33,710 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-02-28 10:10:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-02-28 10:10:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:10:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:10:33,716 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-02-28 10:10:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:33,716 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:10:33,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:10:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:10:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:10:33,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:33,717 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-02-28 10:10:33,718 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-02-28 10:10:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:33,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:33,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:34,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:34,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:34,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:34,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:34,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:34,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:34,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:10:34,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:34,143 INFO L442 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-02-28 10:10:34,143 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:34,151 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:34,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-28 10:10:34,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:34,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:10:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:10:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:34,562 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-02-28 10:10:35,075 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:10:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:35,115 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-28 10:10:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:35,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-02-28 10:10:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:35,117 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:10:35,117 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:10:35,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:10:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-02-28 10:10:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:10:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:10:35,125 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-02-28 10:10:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:35,126 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:10:35,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:10:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:10:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:10:35,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:35,127 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-02-28 10:10:35,127 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-02-28 10:10:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:35,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:35,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:35,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:35,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:35,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:35,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:10:35,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:35,455 INFO L442 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-02-28 10:10:35,456 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,468 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,469 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-28 10:10:36,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:36,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:10:36,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:10:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:10:36,034 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-02-28 10:10:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:36,327 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:10:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:36,327 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-02-28 10:10:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:36,329 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:10:36,329 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:10:36,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:10:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-02-28 10:10:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:10:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:10:36,338 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-02-28 10:10:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:36,338 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:10:36,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:10:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:10:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:10:36,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:36,340 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-02-28 10:10:36,340 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-02-28 10:10:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:37,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:37,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:37,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:37,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:37,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:37,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:37,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:10:37,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:10:37,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:37,185 INFO L442 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-02-28 10:10:37,186 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:37,193 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:37,193 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-28 10:10:37,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:10:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:10:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:37,626 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-02-28 10:10:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:38,099 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:10:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:38,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-02-28 10:10:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:38,102 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:10:38,102 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:10:38,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:10:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-02-28 10:10:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:10:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-28 10:10:38,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-02-28 10:10:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:38,111 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-28 10:10:38,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:10:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-28 10:10:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:10:38,112 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:38,112 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-02-28 10:10:38,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-02-28 10:10:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:38,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:38,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:38,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:38,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:38,477 INFO L442 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-02-28 10:10:38,477 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,492 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,493 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:39,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-28 10:10:39,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:10:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:10:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:10:39,014 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-02-28 10:10:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:39,501 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:10:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:39,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-02-28 10:10:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:39,502 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:10:39,502 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:10:39,503 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-02-28 10:10:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:10:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-02-28 10:10:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:10:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:10:39,512 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-02-28 10:10:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:39,513 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:10:39,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:10:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:10:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:10:39,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:39,514 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-02-28 10:10:39,514 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-02-28 10:10:39,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:39,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:39,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:39,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:39,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:39,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:10:39,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:40,008 INFO L442 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-02-28 10:10:40,008 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:40,016 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:40,017 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:40,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-28 10:10:40,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:40,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:40,509 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-02-28 10:10:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:40,956 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-28 10:10:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:40,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-28 10:10:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:40,957 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:10:40,958 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:10:40,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:10:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-02-28 10:10:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:10:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:10:40,968 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-02-28 10:10:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:40,969 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:10:40,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:10:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:10:40,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:40,970 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-02-28 10:10:40,970 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-02-28 10:10:40,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:41,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:41,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:41,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:41,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:41,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:41,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:10:41,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:41,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:10:41,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:41,318 INFO L442 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-02-28 10:10:41,319 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,329 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,330 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-28 10:10:41,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:41,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:10:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:10:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:10:41,824 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-02-28 10:10:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:42,341 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:10:42,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:42,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-02-28 10:10:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:42,343 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:10:42,343 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:10:42,345 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-02-28 10:10:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:10:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-02-28 10:10:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:10:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:10:42,355 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-02-28 10:10:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:42,355 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:10:42,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:10:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:10:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:10:42,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:42,357 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-02-28 10:10:42,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-02-28 10:10:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:42,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:42,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:42,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:42,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:42,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:42,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:42,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:10:42,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:42,807 INFO L442 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-02-28 10:10:42,808 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:42,885 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:42,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:43,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:43,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:43,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-28 10:10:43,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:43,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:10:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:10:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:43,678 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-02-28 10:10:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:44,453 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:10:44,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:44,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-02-28 10:10:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:44,455 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:10:44,455 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:10:44,457 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-02-28 10:10:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:10:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-02-28 10:10:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:10:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-28 10:10:44,467 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-02-28 10:10:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:44,468 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-28 10:10:44,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:10:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-28 10:10:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:10:44,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:44,469 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-02-28 10:10:44,470 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-02-28 10:10:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:44,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:44,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:44,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:44,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:44,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:44,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:44,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:44,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:10:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:44,890 INFO L442 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-02-28 10:10:44,890 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:44,901 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:44,902 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:46,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-28 10:10:46,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:46,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:10:46,222 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-02-28 10:10:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:46,767 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:10:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:46,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-02-28 10:10:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:46,769 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:10:46,769 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:10:46,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:10:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-02-28 10:10:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:10:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:10:46,781 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-02-28 10:10:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:46,782 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:10:46,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:10:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:10:46,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:46,783 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-02-28 10:10:46,783 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-02-28 10:10:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:47,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:47,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:47,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:47,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:47,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:10:47,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:47,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:10:47,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:47,312 INFO L442 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-02-28 10:10:47,313 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,327 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:47,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:47,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-28 10:10:47,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:47,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:10:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:10:47,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:47,936 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-02-28 10:10:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:48,456 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-28 10:10:48,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:48,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-02-28 10:10:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:48,459 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:10:48,459 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:10:48,461 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-02-28 10:10:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:10:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-02-28 10:10:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:10:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:10:48,471 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-02-28 10:10:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:48,472 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:10:48,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:10:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:10:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:10:48,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:48,473 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-02-28 10:10:48,473 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-02-28 10:10:48,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:48,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:49,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:49,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:49,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:49,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:49,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:49,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:49,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:10:49,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:49,152 INFO L442 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-02-28 10:10:49,152 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:49,164 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:49,165 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-28 10:10:50,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:50,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:10:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:10:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:10:50,521 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-02-28 10:10:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:51,162 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:10:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:51,162 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-02-28 10:10:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:51,163 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:10:51,163 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:10:51,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:10:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-02-28 10:10:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:10:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:10:51,175 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-02-28 10:10:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:51,176 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:10:51,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:10:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:10:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:10:51,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:51,177 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-02-28 10:10:51,177 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-02-28 10:10:51,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:52,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:52,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:52,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:52,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:10:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:52,319 INFO L442 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-02-28 10:10:52,320 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:52,329 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:52,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-28 10:10:53,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:53,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:10:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:10:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:53,077 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-02-28 10:10:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:53,654 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:10:53,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:53,654 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-02-28 10:10:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:53,655 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:10:53,655 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:10:53,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:10:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-02-28 10:10:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:10:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-28 10:10:53,668 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-02-28 10:10:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:53,668 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-28 10:10:53,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:10:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-28 10:10:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:10:53,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:53,669 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-02-28 10:10:53,669 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-02-28 10:10:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:54,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:54,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:54,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:54,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:54,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:54,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:54,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:10:54,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:54,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:10:54,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:54,572 INFO L442 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-02-28 10:10:54,572 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:54,583 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:54,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:55,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:55,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-28 10:10:55,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:55,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:10:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:10:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:10:55,767 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-02-28 10:10:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:56,476 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:10:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:56,477 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-02-28 10:10:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:56,478 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:10:56,478 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:10:56,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:10:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:10:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-02-28 10:10:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:10:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:10:56,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-02-28 10:10:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:56,491 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:10:56,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:10:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:10:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:10:56,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:56,492 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-02-28 10:10:56,492 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-02-28 10:10:56,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:56,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:56,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:56,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:57,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:10:57,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:57,008 INFO L442 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-02-28 10:10:57,019 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:57,031 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:57,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:57,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:57,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-28 10:10:57,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:57,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:10:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:10:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:57,953 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-02-28 10:10:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:58,650 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-28 10:10:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:58,651 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-02-28 10:10:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:58,652 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:10:58,652 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:10:58,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:10:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:10:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-02-28 10:10:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:10:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:10:58,666 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-02-28 10:10:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:58,666 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:10:58,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:10:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:10:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:10:58,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:58,667 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-02-28 10:10:58,667 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:10:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-02-28 10:10:58,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:59,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:59,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:59,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:59,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:59,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:59,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:59,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:59,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:59,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:10:59,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:59,271 INFO L442 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-02-28 10:10:59,272 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:59,282 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:59,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:10:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:59,746 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:00,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-28 10:11:00,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:00,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:11:00,471 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-02-28 10:11:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:01,211 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:11:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:11:01,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-02-28 10:11:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:01,214 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:11:01,214 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:11:01,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:11:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-02-28 10:11:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:11:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:11:01,226 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-02-28 10:11:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:01,226 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:11:01,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:11:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:11:01,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:01,227 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-02-28 10:11:01,227 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-02-28 10:11:01,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:01,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:01,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:01,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:01,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:01,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:01,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:01,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:01,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:01,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:11:01,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:01,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:11:01,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:01,783 INFO L442 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-02-28 10:11:01,783 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:01,791 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:01,791 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:02,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:03,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-28 10:11:03,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:03,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:11:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:11:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:11:03,101 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-02-28 10:11:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:03,896 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:11:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:11:03,896 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-02-28 10:11:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:03,897 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:11:03,897 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:11:03,898 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-02-28 10:11:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:11:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-02-28 10:11:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:11:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-28 10:11:03,910 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-02-28 10:11:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:03,910 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-28 10:11:03,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:11:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-28 10:11:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:11:03,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:03,911 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-02-28 10:11:03,911 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-02-28 10:11:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:04,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:04,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:04,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:04,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:04,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:04,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:11:04,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:04,435 INFO L442 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-02-28 10:11:04,436 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:04,532 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:04,533 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:05,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:05,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-28 10:11:05,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:05,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:11:05,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:11:05,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:11:05,994 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-02-28 10:11:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:06,853 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-28 10:11:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:11:06,853 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-02-28 10:11:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:06,854 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:11:06,854 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:11:06,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:11:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-02-28 10:11:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-28 10:11:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-28 10:11:06,873 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-02-28 10:11:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:06,873 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-28 10:11:06,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:11:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-28 10:11:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-28 10:11:06,874 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:06,874 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-02-28 10:11:06,874 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-02-28 10:11:06,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:06,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:07,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:07,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:07,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:07,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:07,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:07,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:11:07,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:07,490 INFO L442 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-02-28 10:11:07,491 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:07,499 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:07,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:07,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:08,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:08,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-28 10:11:08,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:08,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:11:08,716 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-02-28 10:11:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:09,763 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-02-28 10:11:09,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:11:09,763 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-02-28 10:11:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:09,764 INFO L225 Difference]: With dead ends: 125 [2019-02-28 10:11:09,764 INFO L226 Difference]: Without dead ends: 124 [2019-02-28 10:11:09,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-28 10:11:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-02-28 10:11:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:11:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-28 10:11:09,778 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-02-28 10:11:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:09,778 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-28 10:11:09,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-28 10:11:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-28 10:11:09,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:09,779 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-02-28 10:11:09,779 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-02-28 10:11:09,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:09,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:09,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:10,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:10,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:10,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:10,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:10,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:10,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:10,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:11:10,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:10,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:11:10,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:10,946 INFO L442 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-02-28 10:11:10,946 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:10,958 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:10,958 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:11,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:12,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-28 10:11:12,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:12,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:11:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:11:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:11:12,276 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-02-28 10:11:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:13,228 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-28 10:11:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:11:13,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-02-28 10:11:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:13,230 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:11:13,230 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:11:13,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:11:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-02-28 10:11:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-28 10:11:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-28 10:11:13,249 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-02-28 10:11:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:13,250 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-28 10:11:13,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:11:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-28 10:11:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-28 10:11:13,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:13,251 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-02-28 10:11:13,251 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-02-28 10:11:13,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:13,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:13,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:13,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:13,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:14,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:14,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:14,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:14,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:14,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:14,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:14,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:14,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:14,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:14,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:11:14,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:14,422 INFO L442 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-02-28 10:11:14,423 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:14,434 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:14,434 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:14,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-28 10:11:16,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:16,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:11:16,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:11:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:16,079 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-02-28 10:11:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:17,096 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-28 10:11:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:11:17,097 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-02-28 10:11:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:17,099 INFO L225 Difference]: With dead ends: 135 [2019-02-28 10:11:17,099 INFO L226 Difference]: Without dead ends: 134 [2019-02-28 10:11:17,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:11:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-28 10:11:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-02-28 10:11:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-28 10:11:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-02-28 10:11:17,118 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-02-28 10:11:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:17,118 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-02-28 10:11:17,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:11:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-02-28 10:11:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-28 10:11:17,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:17,119 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-02-28 10:11:17,119 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-02-28 10:11:17,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:17,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:17,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:17,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:17,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:17,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:17,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:17,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:17,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:17,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:17,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:17,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:17,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:17,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:11:17,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:17,726 INFO L442 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-02-28 10:11:17,727 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:17,735 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:17,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:18,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:19,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-28 10:11:19,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:19,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:11:19,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:11:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:11:19,241 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-02-28 10:11:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:20,555 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-28 10:11:20,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:11:20,556 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-02-28 10:11:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:20,556 INFO L225 Difference]: With dead ends: 140 [2019-02-28 10:11:20,556 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:11:20,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:11:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:11:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-02-28 10:11:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:11:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-28 10:11:20,577 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-02-28 10:11:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:20,577 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-28 10:11:20,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:11:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-28 10:11:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:11:20,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:20,578 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-02-28 10:11:20,579 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-02-28 10:11:20,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:20,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:20,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:20,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:20,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:21,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:21,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:21,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:21,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:21,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:21,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:21,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:11:21,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:21,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:11:21,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:21,368 INFO L442 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-02-28 10:11:21,369 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:21,459 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:21,460 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:22,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:24,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-28 10:11:24,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:24,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:11:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:11:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:24,106 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-02-28 10:11:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:25,201 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-02-28 10:11:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:11:25,201 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-02-28 10:11:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:25,202 INFO L225 Difference]: With dead ends: 145 [2019-02-28 10:11:25,202 INFO L226 Difference]: Without dead ends: 144 [2019-02-28 10:11:25,203 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-02-28 10:11:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-28 10:11:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-02-28 10:11:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:11:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-28 10:11:25,223 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-02-28 10:11:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:25,223 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-28 10:11:25,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:11:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-28 10:11:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-28 10:11:25,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:25,224 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-02-28 10:11:25,224 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-02-28 10:11:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:25,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:25,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:25,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:25,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:25,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:25,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:26,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:26,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:26,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:11:26,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:26,038 INFO L442 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-02-28 10:11:26,039 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:26,047 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:26,047 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:28,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:28,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-28 10:11:28,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:11:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:11:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:11:28,125 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-02-28 10:11:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:29,340 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-28 10:11:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:11:29,340 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-02-28 10:11:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:29,341 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:11:29,341 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:11:29,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:11:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:11:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-02-28 10:11:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-02-28 10:11:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-02-28 10:11:29,365 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-02-28 10:11:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:29,366 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-02-28 10:11:29,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:11:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-02-28 10:11:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-02-28 10:11:29,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:29,367 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-02-28 10:11:29,367 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-02-28 10:11:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:29,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:29,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:29,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:29,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:29,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:29,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:29,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:30,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:11:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:30,093 INFO L442 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-02-28 10:11:30,093 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:30,105 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:30,106 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:30,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:32,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-28 10:11:32,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:32,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:11:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:11:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:32,139 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-02-28 10:11:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:33,301 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-28 10:11:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:11:33,302 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-02-28 10:11:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:33,303 INFO L225 Difference]: With dead ends: 155 [2019-02-28 10:11:33,303 INFO L226 Difference]: Without dead ends: 154 [2019-02-28 10:11:33,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:11:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-28 10:11:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-02-28 10:11:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-28 10:11:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-28 10:11:33,321 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-02-28 10:11:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:33,321 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-28 10:11:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:11:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-28 10:11:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-28 10:11:33,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:33,322 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-02-28 10:11:33,322 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-02-28 10:11:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:34,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:34,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:34,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:34,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:34,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:35,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:11:35,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:35,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:11:35,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:35,076 INFO L442 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-02-28 10:11:35,077 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,086 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:35,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:36,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:37,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:37,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-28 10:11:37,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:37,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:11:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:11:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:11:37,671 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-02-28 10:11:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:38,930 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-02-28 10:11:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:11:38,931 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-02-28 10:11:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:38,932 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:11:38,932 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:11:38,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:11:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:11:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-02-28 10:11:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-02-28 10:11:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-02-28 10:11:38,956 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-02-28 10:11:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:38,956 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-02-28 10:11:38,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:11:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-02-28 10:11:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-02-28 10:11:38,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:38,957 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-02-28 10:11:38,957 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-02-28 10:11:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:38,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:38,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:39,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:39,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:39,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:39,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:39,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:39,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:39,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:39,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:39,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:39,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:39,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:11:39,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:39,831 INFO L442 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-02-28 10:11:39,831 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:39,841 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:39,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:40,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:42,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:42,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-28 10:11:42,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:42,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:11:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:11:42,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:42,371 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-02-28 10:11:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:43,742 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-28 10:11:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:11:43,742 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-02-28 10:11:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:43,743 INFO L225 Difference]: With dead ends: 165 [2019-02-28 10:11:43,743 INFO L226 Difference]: Without dead ends: 164 [2019-02-28 10:11:43,748 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-02-28 10:11:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-28 10:11:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-02-28 10:11:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:11:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-28 10:11:43,771 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-02-28 10:11:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:43,772 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-28 10:11:43,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:11:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-28 10:11:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:11:43,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:43,773 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-02-28 10:11:43,773 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-02-28 10:11:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:44,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:44,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:44,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:44,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:44,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:44,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:44,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:11:44,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:44,619 INFO L442 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-02-28 10:11:44,619 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:44,629 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:44,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:45,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:47,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-28 10:11:47,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:47,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:11:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:11:47,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:11:47,084 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-02-28 10:11:47,793 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:11:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:49,007 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-02-28 10:11:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:11:49,008 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-02-28 10:11:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:49,009 INFO L225 Difference]: With dead ends: 170 [2019-02-28 10:11:49,009 INFO L226 Difference]: Without dead ends: 169 [2019-02-28 10:11:49,011 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-02-28 10:11:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-28 10:11:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-02-28 10:11:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-28 10:11:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-28 10:11:49,044 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-02-28 10:11:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:49,044 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-28 10:11:49,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:11:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-28 10:11:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-28 10:11:49,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:49,045 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-02-28 10:11:49,046 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-02-28 10:11:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:49,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:49,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:50,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:50,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:50,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:50,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:50,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:50,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:50,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:50,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:50,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:11:50,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:50,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:11:50,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:50,895 INFO L442 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-02-28 10:11:50,895 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:50,904 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:50,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:51,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:54,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-28 10:11:54,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:54,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:11:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:11:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:54,080 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-02-28 10:11:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:55,517 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-28 10:11:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:11:55,517 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-02-28 10:11:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:55,518 INFO L225 Difference]: With dead ends: 175 [2019-02-28 10:11:55,518 INFO L226 Difference]: Without dead ends: 174 [2019-02-28 10:11:55,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:11:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-28 10:11:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-02-28 10:11:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:11:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-02-28 10:11:55,543 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-02-28 10:11:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:55,544 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-02-28 10:11:55,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:11:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-02-28 10:11:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:11:55,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:55,545 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-02-28 10:11:55,545 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:11:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-02-28 10:11:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:55,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:55,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:55,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:56,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:56,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:56,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:56,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:56,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:56,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:56,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:56,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:56,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:11:56,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:56,804 INFO L442 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-02-28 10:11:56,804 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:56,835 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:56,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:11:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:57,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-28 10:11:59,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:59,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:11:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:11:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:11:59,311 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-02-28 10:12:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:01,263 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-28 10:12:01,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:12:01,264 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-02-28 10:12:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:01,265 INFO L225 Difference]: With dead ends: 180 [2019-02-28 10:12:01,265 INFO L226 Difference]: Without dead ends: 179 [2019-02-28 10:12:01,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:12:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-28 10:12:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-02-28 10:12:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-28 10:12:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-02-28 10:12:01,299 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-02-28 10:12:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:01,300 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-02-28 10:12:01,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:12:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-02-28 10:12:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-02-28 10:12:01,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:01,301 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-02-28 10:12:01,301 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-02-28 10:12:01,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:01,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:01,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:01,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:02,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:02,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:02,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:02,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:02,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:02,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:02,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:02,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:12:02,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:02,341 INFO L442 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-02-28 10:12:02,341 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,431 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:02,431 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:03,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:05,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:05,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-28 10:12:05,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:05,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:12:05,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:12:05,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:05,076 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-02-28 10:12:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:06,796 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-02-28 10:12:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:12:06,797 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-02-28 10:12:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:06,798 INFO L225 Difference]: With dead ends: 185 [2019-02-28 10:12:06,798 INFO L226 Difference]: Without dead ends: 184 [2019-02-28 10:12:06,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:12:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-28 10:12:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-02-28 10:12:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-28 10:12:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-28 10:12:06,832 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-02-28 10:12:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:06,832 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-28 10:12:06,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:12:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-28 10:12:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-28 10:12:06,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:06,833 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-02-28 10:12:06,834 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-02-28 10:12:06,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:07,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:07,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:07,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:07,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:07,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:07,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:12:07,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:07,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-28 10:12:07,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:07,951 INFO L442 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-02-28 10:12:07,952 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:08,044 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:08,045 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:09,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:10,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-28 10:12:10,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:10,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:12:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:12:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:12:10,881 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-02-28 10:12:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:12,641 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-02-28 10:12:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:12:12,641 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-02-28 10:12:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:12,642 INFO L225 Difference]: With dead ends: 190 [2019-02-28 10:12:12,642 INFO L226 Difference]: Without dead ends: 189 [2019-02-28 10:12:12,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:12:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-28 10:12:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-02-28 10:12:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-28 10:12:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-02-28 10:12:12,671 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-02-28 10:12:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:12,671 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-02-28 10:12:12,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:12:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-02-28 10:12:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-02-28 10:12:12,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:12,672 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-02-28 10:12:12,672 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-02-28 10:12:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:12,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:12,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:13,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:13,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:13,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:13,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:13,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:13,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:13,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:13,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:13,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:13,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:13,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:12:13,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:13,650 INFO L442 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-02-28 10:12:13,651 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:13,723 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:13,724 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:15,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:17,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:17,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-28 10:12:17,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:17,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:12:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:12:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:17,876 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-02-28 10:12:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:19,636 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-28 10:12:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:12:19,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-02-28 10:12:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:19,637 INFO L225 Difference]: With dead ends: 195 [2019-02-28 10:12:19,637 INFO L226 Difference]: Without dead ends: 194 [2019-02-28 10:12:19,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:12:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-28 10:12:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-02-28 10:12:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-28 10:12:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-02-28 10:12:19,676 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-02-28 10:12:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:19,677 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-02-28 10:12:19,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:12:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-02-28 10:12:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-28 10:12:19,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:19,678 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-02-28 10:12:19,678 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-02-28 10:12:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:19,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:20,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:20,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:20,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:20,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:20,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:20,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:20,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 128 conjunts are in the unsatisfiable core [2019-02-28 10:12:20,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:20,730 INFO L442 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-02-28 10:12:20,731 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:20,745 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:20,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:22,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:24,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:24,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-28 10:12:24,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:24,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:12:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:12:24,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:12:24,098 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-02-28 10:12:24,704 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:12:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:26,424 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-02-28 10:12:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:12:26,424 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-02-28 10:12:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:26,425 INFO L225 Difference]: With dead ends: 200 [2019-02-28 10:12:26,425 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:12:26,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:12:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:12:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-02-28 10:12:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-28 10:12:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-28 10:12:26,456 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-02-28 10:12:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:26,456 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-28 10:12:26,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:12:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-28 10:12:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-28 10:12:26,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:26,457 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-02-28 10:12:26,457 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-02-28 10:12:26,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:26,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:26,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:26,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:26,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:27,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:27,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:27,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:27,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:27,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:27,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:27,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:27,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:12:27,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:27,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:12:27,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:27,966 INFO L442 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-02-28 10:12:27,967 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:27,977 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:27,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:29,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:31,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:31,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-28 10:12:31,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:31,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:12:31,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:12:31,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:31,165 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-02-28 10:12:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:33,202 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-02-28 10:12:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:12:33,202 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-02-28 10:12:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:33,203 INFO L225 Difference]: With dead ends: 205 [2019-02-28 10:12:33,203 INFO L226 Difference]: Without dead ends: 204 [2019-02-28 10:12:33,204 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-02-28 10:12:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-28 10:12:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-02-28 10:12:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-28 10:12:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-28 10:12:33,234 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-02-28 10:12:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:33,234 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-28 10:12:33,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:12:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-28 10:12:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-28 10:12:33,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:33,235 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-02-28 10:12:33,236 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-02-28 10:12:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:33,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:33,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:34,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:34,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:34,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:34,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:34,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:34,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:34,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:34,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:34,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-28 10:12:34,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:34,471 INFO L442 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-02-28 10:12:34,471 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:34,479 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:34,480 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:35,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:38,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:38,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-28 10:12:38,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:38,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:12:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:12:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:12:38,031 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-02-28 10:12:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:39,908 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-28 10:12:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:12:39,908 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-02-28 10:12:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:39,909 INFO L225 Difference]: With dead ends: 210 [2019-02-28 10:12:39,909 INFO L226 Difference]: Without dead ends: 209 [2019-02-28 10:12:39,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:12:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-28 10:12:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-02-28 10:12:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-28 10:12:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-02-28 10:12:39,943 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-02-28 10:12:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:39,943 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-02-28 10:12:39,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:12:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-02-28 10:12:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-28 10:12:39,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:39,944 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-02-28 10:12:39,944 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-02-28 10:12:39,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:39,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:39,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:39,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:41,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:41,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:41,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:41,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:41,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:41,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:41,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:41,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 137 conjunts are in the unsatisfiable core [2019-02-28 10:12:41,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:41,236 INFO L442 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-02-28 10:12:41,236 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:41,245 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:41,245 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:42,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:44,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:44,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-28 10:12:44,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:44,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:12:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:12:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:12:44,965 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-02-28 10:12:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:46,904 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-28 10:12:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:12:46,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-02-28 10:12:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:46,905 INFO L225 Difference]: With dead ends: 215 [2019-02-28 10:12:46,906 INFO L226 Difference]: Without dead ends: 214 [2019-02-28 10:12:46,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:12:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-28 10:12:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-02-28 10:12:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-28 10:12:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-28 10:12:46,948 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-02-28 10:12:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:46,949 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-28 10:12:46,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:12:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-28 10:12:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-28 10:12:46,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:46,950 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-02-28 10:12:46,950 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-02-28 10:12:46,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:46,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:48,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:48,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:48,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:48,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:48,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:48,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:48,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:48,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:48,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:12:48,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:48,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-28 10:12:48,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:48,869 INFO L442 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-02-28 10:12:48,870 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:48,894 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:48,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:50,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-28 10:12:52,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:52,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:12:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:12:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:12:52,580 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-02-28 10:12:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:54,650 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-02-28 10:12:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:12:54,650 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-02-28 10:12:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:54,651 INFO L225 Difference]: With dead ends: 220 [2019-02-28 10:12:54,652 INFO L226 Difference]: Without dead ends: 219 [2019-02-28 10:12:54,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:12:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-02-28 10:12:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-02-28 10:12:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-02-28 10:12:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-02-28 10:12:54,700 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-02-28 10:12:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:54,700 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-02-28 10:12:54,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:12:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-02-28 10:12:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-02-28 10:12:54,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:54,701 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-02-28 10:12:54,701 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:12:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-02-28 10:12:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:55,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:55,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:55,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:55,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:55,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:55,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:55,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:55,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:55,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-28 10:12:55,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:55,957 INFO L442 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-02-28 10:12:55,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:55,966 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:55,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:12:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:57,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-28 10:12:59,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:59,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:12:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:12:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:12:59,928 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-02-28 10:13:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:02,027 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-28 10:13:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:13:02,027 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-02-28 10:13:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:02,028 INFO L225 Difference]: With dead ends: 225 [2019-02-28 10:13:02,029 INFO L226 Difference]: Without dead ends: 224 [2019-02-28 10:13:02,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:13:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-28 10:13:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-02-28 10:13:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-28 10:13:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-28 10:13:02,066 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-02-28 10:13:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:02,066 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-28 10:13:02,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:13:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-28 10:13:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-28 10:13:02,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:02,067 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-02-28 10:13:02,067 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:02,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-02-28 10:13:02,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:02,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:02,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:03,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:03,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:03,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:03,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:03,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:03,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 146 conjunts are in the unsatisfiable core [2019-02-28 10:13:03,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:03,798 INFO L442 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-02-28 10:13:03,799 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:03,817 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:03,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:05,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-28 10:13:07,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:07,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:13:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:13:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-02-28 10:13:07,731 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-02-28 10:13:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:10,175 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-02-28 10:13:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:13:10,176 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-02-28 10:13:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:10,177 INFO L225 Difference]: With dead ends: 230 [2019-02-28 10:13:10,177 INFO L226 Difference]: Without dead ends: 229 [2019-02-28 10:13:10,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:13:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-02-28 10:13:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-02-28 10:13:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-28 10:13:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-28 10:13:10,225 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-02-28 10:13:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:10,225 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-28 10:13:10,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:13:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-28 10:13:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-28 10:13:10,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:10,226 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-02-28 10:13:10,227 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-02-28 10:13:10,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:10,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:11,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:11,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:11,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:11,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:11,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:11,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:11,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:13:11,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:11,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-28 10:13:11,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:11,699 INFO L442 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-02-28 10:13:11,700 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:11,709 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:11,709 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:13,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:16,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:16,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-28 10:13:16,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:16,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:13:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:13:16,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:16,379 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-02-28 10:13:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:18,876 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-28 10:13:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:13:18,877 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-02-28 10:13:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:18,878 INFO L225 Difference]: With dead ends: 235 [2019-02-28 10:13:18,878 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 10:13:18,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:13:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 10:13:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-02-28 10:13:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-28 10:13:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-02-28 10:13:18,938 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-02-28 10:13:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:18,938 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-02-28 10:13:18,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:13:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-02-28 10:13:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-28 10:13:18,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:18,940 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-02-28 10:13:18,940 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-02-28 10:13:18,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:18,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:18,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:18,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:18,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:20,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:20,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:20,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:20,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:20,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:20,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:20,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:20,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:20,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:20,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:20,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:13:20,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:20,432 INFO L442 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-02-28 10:13:20,432 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:20,443 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:20,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:21,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:24,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-28 10:13:24,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:24,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:13:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:13:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-02-28 10:13:24,980 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-02-28 10:13:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:27,461 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-28 10:13:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:13:27,462 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-02-28 10:13:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:27,463 INFO L225 Difference]: With dead ends: 240 [2019-02-28 10:13:27,463 INFO L226 Difference]: Without dead ends: 239 [2019-02-28 10:13:27,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:13:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-28 10:13:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-02-28 10:13:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-28 10:13:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-02-28 10:13:27,525 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-02-28 10:13:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:27,526 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-02-28 10:13:27,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:13:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-02-28 10:13:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-02-28 10:13:27,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:27,527 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-02-28 10:13:27,528 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-02-28 10:13:27,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:27,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:27,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:29,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:29,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:29,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:29,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:29,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:29,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:29,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-28 10:13:29,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:29,428 INFO L442 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-02-28 10:13:29,429 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,437 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:29,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:30,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:34,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-28 10:13:34,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:34,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:13:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:13:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:13:34,246 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-02-28 10:13:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:36,798 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-02-28 10:13:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:13:36,799 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-02-28 10:13:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:36,800 INFO L225 Difference]: With dead ends: 245 [2019-02-28 10:13:36,800 INFO L226 Difference]: Without dead ends: 244 [2019-02-28 10:13:36,801 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-02-28 10:13:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-02-28 10:13:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-02-28 10:13:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-28 10:13:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-28 10:13:36,841 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-02-28 10:13:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:36,841 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-28 10:13:36,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:13:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-28 10:13:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-28 10:13:36,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:36,842 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-02-28 10:13:36,843 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-02-28 10:13:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:36,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:36,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:38,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:38,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:38,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:38,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:38,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:38,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:38,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:38,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:38,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:13:38,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:38,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-28 10:13:38,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:38,689 INFO L442 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-02-28 10:13:38,689 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:38,697 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:38,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:40,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:43,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:43,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-28 10:13:43,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:43,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:13:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:13:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:13:43,353 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-02-28 10:13:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:45,846 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-02-28 10:13:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:13:45,847 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-02-28 10:13:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:45,848 INFO L225 Difference]: With dead ends: 250 [2019-02-28 10:13:45,848 INFO L226 Difference]: Without dead ends: 249 [2019-02-28 10:13:45,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:13:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-28 10:13:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-02-28 10:13:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-02-28 10:13:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-02-28 10:13:45,904 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-02-28 10:13:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:45,904 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-02-28 10:13:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:13:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-02-28 10:13:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-02-28 10:13:45,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:45,905 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-02-28 10:13:45,906 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-02-28 10:13:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:47,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:47,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:47,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:47,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:47,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-28 10:13:47,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:47,371 INFO L442 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-02-28 10:13:47,371 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:47,380 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:47,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:49,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:52,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-28 10:13:52,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:13:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:13:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:13:52,421 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-02-28 10:13:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:55,218 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-28 10:13:55,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:13:55,219 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-02-28 10:13:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:55,220 INFO L225 Difference]: With dead ends: 255 [2019-02-28 10:13:55,220 INFO L226 Difference]: Without dead ends: 254 [2019-02-28 10:13:55,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:13:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-28 10:13:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-02-28 10:13:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-02-28 10:13:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-02-28 10:13:55,289 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-02-28 10:13:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:55,290 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-02-28 10:13:55,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:13:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-02-28 10:13:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-02-28 10:13:55,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:55,291 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-02-28 10:13:55,291 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:13:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-02-28 10:13:55,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:55,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:55,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:56,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:56,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:56,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:56,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:56,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:56,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:56,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:56,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 164 conjunts are in the unsatisfiable core [2019-02-28 10:13:56,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:56,871 INFO L442 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-02-28 10:13:56,871 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:56,882 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:56,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:13:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:58,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:02,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-02-28 10:14:02,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:02,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:14:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:14:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:14:02,407 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-02-28 10:14:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:05,231 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-02-28 10:14:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:14:05,231 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-02-28 10:14:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:05,233 INFO L225 Difference]: With dead ends: 260 [2019-02-28 10:14:05,233 INFO L226 Difference]: Without dead ends: 259 [2019-02-28 10:14:05,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:14:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-28 10:14:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-02-28 10:14:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-28 10:14:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-28 10:14:05,307 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-02-28 10:14:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:05,307 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-28 10:14:05,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:14:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-28 10:14:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-28 10:14:05,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:05,309 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-02-28 10:14:05,309 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-02-28 10:14:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:05,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:05,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:05,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:06,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:06,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:06,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:06,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:06,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:06,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:06,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:07,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:14:07,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-28 10:14:07,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:07,097 INFO L442 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-02-28 10:14:07,098 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:07,108 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:07,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:14:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:08,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-02-28 10:14:12,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:12,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:14:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:14:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:14:12,269 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-02-28 10:14:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:15,223 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-02-28 10:14:15,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:14:15,223 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-02-28 10:14:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:15,224 INFO L225 Difference]: With dead ends: 265 [2019-02-28 10:14:15,224 INFO L226 Difference]: Without dead ends: 264 [2019-02-28 10:14:15,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:14:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-28 10:14:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-02-28 10:14:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-28 10:14:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-28 10:14:15,278 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-02-28 10:14:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:15,278 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-28 10:14:15,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:14:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-28 10:14:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-28 10:14:15,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:15,280 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-02-28 10:14:15,280 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-02-28 10:14:15,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:15,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:15,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:16,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:16,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:16,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:16,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:16,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:16,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:16,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:16,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:16,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:16,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:16,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-28 10:14:16,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:16,944 INFO L442 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-02-28 10:14:16,944 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:16,955 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:16,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:14:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:18,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-02-28 10:14:22,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:22,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:14:22,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:14:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:14:22,427 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-02-28 10:14:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:25,566 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-28 10:14:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:14:25,567 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-02-28 10:14:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:25,568 INFO L225 Difference]: With dead ends: 270 [2019-02-28 10:14:25,568 INFO L226 Difference]: Without dead ends: 269 [2019-02-28 10:14:25,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:14:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-28 10:14:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-02-28 10:14:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-28 10:14:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-02-28 10:14:25,625 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-02-28 10:14:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:25,625 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-02-28 10:14:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:14:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-02-28 10:14:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-02-28 10:14:25,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:25,627 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-02-28 10:14:25,627 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-02-28 10:14:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:25,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:25,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:27,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:27,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:27,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:27,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:27,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:27,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:27,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:27,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:27,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 173 conjunts are in the unsatisfiable core [2019-02-28 10:14:27,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:27,301 INFO L442 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-02-28 10:14:27,301 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:27,311 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:27,311 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:14:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:29,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-02-28 10:14:32,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:32,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:14:32,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:14:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:14:32,829 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-02-28 10:14:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:35,945 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-28 10:14:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:14:35,945 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-02-28 10:14:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:35,946 INFO L225 Difference]: With dead ends: 275 [2019-02-28 10:14:35,946 INFO L226 Difference]: Without dead ends: 274 [2019-02-28 10:14:35,948 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-02-28 10:14:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-28 10:14:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-02-28 10:14:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-28 10:14:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-28 10:14:35,997 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-02-28 10:14:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:35,997 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-28 10:14:35,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:14:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-28 10:14:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-28 10:14:35,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:35,999 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-02-28 10:14:35,999 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:35,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-02-28 10:14:35,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:36,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:36,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:37,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:37,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:37,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:37,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:37,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:37,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:37,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:37,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:38,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:14:38,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:38,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:14:38,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:38,136 INFO L442 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-02-28 10:14:38,136 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:38,145 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:38,145 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:14:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:40,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:43,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:43,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-02-28 10:14:43,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:43,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:14:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:14:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-02-28 10:14:43,553 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-02-28 10:14:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:46,716 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-02-28 10:14:46,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:14:46,716 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-02-28 10:14:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:46,718 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:14:46,718 INFO L226 Difference]: Without dead ends: 279 [2019-02-28 10:14:46,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:14:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-28 10:14:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-02-28 10:14:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-28 10:14:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-02-28 10:14:46,783 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-02-28 10:14:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-02-28 10:14:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:14:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-02-28 10:14:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-28 10:14:46,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:46,785 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-02-28 10:14:46,785 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-02-28 10:14:46,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:46,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:46,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:46,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:48,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:48,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:48,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:48,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:48,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:48,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:48,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:48,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:48,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:48,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-28 10:14:48,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:48,636 INFO L442 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-02-28 10:14:48,637 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:48,646 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:48,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:14:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:50,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-02-28 10:14:54,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:54,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-28 10:14:54,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-28 10:14:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:14:54,243 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-02-28 10:14:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:57,585 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-28 10:14:57,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:14:57,585 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-02-28 10:14:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:57,587 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:14:57,587 INFO L226 Difference]: Without dead ends: 284 [2019-02-28 10:14:57,588 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-02-28 10:14:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-28 10:14:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-02-28 10:14:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-28 10:14:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-28 10:14:57,642 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-02-28 10:14:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:57,643 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-28 10:14:57,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-28 10:14:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-28 10:14:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-28 10:14:57,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:57,644 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-02-28 10:14:57,644 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:14:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-02-28 10:14:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:57,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:57,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:59,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:59,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:59,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:59,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:59,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:59,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:59,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:59,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 182 conjunts are in the unsatisfiable core [2019-02-28 10:14:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:59,447 INFO L442 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-02-28 10:14:59,447 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:59,456 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:59,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:15:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:01,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:05,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:05,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-02-28 10:15:05,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:05,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-28 10:15:05,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-28 10:15:05,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:15:05,429 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-02-28 10:15:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:08,661 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-02-28 10:15:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:15:08,662 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-02-28 10:15:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:08,663 INFO L225 Difference]: With dead ends: 290 [2019-02-28 10:15:08,663 INFO L226 Difference]: Without dead ends: 289 [2019-02-28 10:15:08,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:15:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-28 10:15:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-02-28 10:15:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-28 10:15:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-28 10:15:08,719 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-02-28 10:15:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:08,719 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-28 10:15:08,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-28 10:15:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-28 10:15:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-28 10:15:08,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:08,720 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-02-28 10:15:08,720 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:15:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-02-28 10:15:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:08,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:10,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:10,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:10,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:10,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:10,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:10,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:10,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:15:10,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:10,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-28 10:15:10,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:10,919 INFO L442 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-02-28 10:15:10,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:10,927 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:10,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:15:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:13,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:16,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:16,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-02-28 10:15:16,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:16,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:15:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:15:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:16,914 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-02-28 10:15:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:20,216 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-28 10:15:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:15:20,217 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-02-28 10:15:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:20,218 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:15:20,218 INFO L226 Difference]: Without dead ends: 294 [2019-02-28 10:15:20,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:15:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-28 10:15:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-02-28 10:15:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-02-28 10:15:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-02-28 10:15:20,289 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-02-28 10:15:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:20,289 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-02-28 10:15:20,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:15:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-02-28 10:15:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-02-28 10:15:20,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:20,291 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-02-28 10:15:20,291 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:15:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-02-28 10:15:20,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:20,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:20,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:22,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:22,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:22,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:22,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:22,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:22,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:22,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:22,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:22,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:22,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:15:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:22,541 INFO L442 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-02-28 10:15:22,541 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:22,550 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:22,550 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:15:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:24,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-02-28 10:15:28,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:28,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-28 10:15:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-28 10:15:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:15:28,596 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-02-28 10:15:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:32,146 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-28 10:15:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:15:32,147 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-02-28 10:15:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:32,148 INFO L225 Difference]: With dead ends: 300 [2019-02-28 10:15:32,148 INFO L226 Difference]: Without dead ends: 299 [2019-02-28 10:15:32,150 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-02-28 10:15:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-28 10:15:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-02-28 10:15:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-02-28 10:15:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-02-28 10:15:32,215 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-02-28 10:15:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:32,216 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-02-28 10:15:32,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-28 10:15:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-02-28 10:15:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-02-28 10:15:32,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:32,217 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-02-28 10:15:32,218 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:15:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-02-28 10:15:32,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:32,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:32,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:34,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:34,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:34,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:34,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:34,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:34,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:34,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:34,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 191 conjunts are in the unsatisfiable core [2019-02-28 10:15:34,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:34,246 INFO L442 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-02-28 10:15:34,246 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:34,256 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:34,256 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:15:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:36,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:40,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:40,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-02-28 10:15:40,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:40,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-28 10:15:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-28 10:15:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:40,543 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-02-28 10:15:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:44,264 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-02-28 10:15:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:15:44,264 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-02-28 10:15:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:44,265 INFO L225 Difference]: With dead ends: 305 [2019-02-28 10:15:44,265 INFO L226 Difference]: Without dead ends: 304 [2019-02-28 10:15:44,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:15:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-02-28 10:15:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-02-28 10:15:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-28 10:15:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-28 10:15:44,326 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-02-28 10:15:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:44,326 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-28 10:15:44,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-28 10:15:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-28 10:15:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-28 10:15:44,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:44,327 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-02-28 10:15:44,327 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:15:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-02-28 10:15:44,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:44,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:46,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:46,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:46,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:46,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:46,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:46,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:46,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:46,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:46,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:15:46,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:46,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-28 10:15:46,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:46,614 INFO L442 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-02-28 10:15:46,614 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:46,625 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:46,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:15:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:48,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:52,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-02-28 10:15:52,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:52,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:15:52,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:15:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:15:52,920 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-02-28 10:15:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:56,574 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-02-28 10:15:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:15:56,574 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-02-28 10:15:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:56,575 INFO L225 Difference]: With dead ends: 310 [2019-02-28 10:15:56,575 INFO L226 Difference]: Without dead ends: 309 [2019-02-28 10:15:56,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-02-28 10:15:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-02-28 10:15:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-02-28 10:15:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-02-28 10:15:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-02-28 10:15:56,646 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-02-28 10:15:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:56,646 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-02-28 10:15:56,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:15:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-02-28 10:15:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-02-28 10:15:56,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:56,647 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-02-28 10:15:56,647 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:15:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-02-28 10:15:56,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:56,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:56,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:56,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:58,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:58,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:58,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:58,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:58,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:58,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:58,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:58,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:58,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:58,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:58,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-28 10:15:58,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:58,851 INFO L442 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-02-28 10:15:58,851 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:58,860 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:58,860 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:16:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:01,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:05,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:05,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-02-28 10:16:05,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:05,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-28 10:16:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-28 10:16:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:16:05,197 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-02-28 10:16:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:09,083 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-28 10:16:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:16:09,084 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-02-28 10:16:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:09,085 INFO L225 Difference]: With dead ends: 315 [2019-02-28 10:16:09,085 INFO L226 Difference]: Without dead ends: 314 [2019-02-28 10:16:09,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-02-28 10:16:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-28 10:16:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-02-28 10:16:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-02-28 10:16:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-02-28 10:16:09,168 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-02-28 10:16:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:09,168 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-02-28 10:16:09,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-28 10:16:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-02-28 10:16:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-02-28 10:16:09,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:09,169 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-02-28 10:16:09,169 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:16:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-02-28 10:16:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:11,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:11,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:11,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:11,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:11,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:11,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:11,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:11,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:11,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 200 conjunts are in the unsatisfiable core [2019-02-28 10:16:11,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:11,375 INFO L442 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-02-28 10:16:11,375 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:11,385 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:11,385 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:16:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:13,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:18,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-02-28 10:16:18,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:18,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-28 10:16:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-28 10:16:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-02-28 10:16:18,082 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-02-28 10:16:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:22,001 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-02-28 10:16:22,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:16:22,002 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-02-28 10:16:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:22,003 INFO L225 Difference]: With dead ends: 320 [2019-02-28 10:16:22,003 INFO L226 Difference]: Without dead ends: 319 [2019-02-28 10:16:22,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-02-28 10:16:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-02-28 10:16:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-02-28 10:16:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-02-28 10:16:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-02-28 10:16:22,073 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-02-28 10:16:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:22,073 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-02-28 10:16:22,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-28 10:16:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-02-28 10:16:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-02-28 10:16:22,075 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:22,075 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-02-28 10:16:22,075 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:16:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-02-28 10:16:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:22,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:24,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:24,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:24,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:24,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:24,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:24,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:24,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:24,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:24,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:16:24,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:24,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-28 10:16:24,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:24,835 INFO L442 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-02-28 10:16:24,836 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:24,848 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:24,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:16:27,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-02-28 10:16:27,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:31,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-02-28 10:16:31,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:31,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:16:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:16:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:16:31,378 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-02-28 10:16:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:35,270 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-02-28 10:16:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:16:35,270 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-02-28 10:16:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:35,271 INFO L225 Difference]: With dead ends: 325 [2019-02-28 10:16:35,271 INFO L226 Difference]: Without dead ends: 324 [2019-02-28 10:16:35,273 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-02-28 10:16:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-02-28 10:16:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-02-28 10:16:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-28 10:16:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-28 10:16:35,344 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-02-28 10:16:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:35,344 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-28 10:16:35,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:16:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-28 10:16:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-28 10:16:35,345 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:35,346 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-02-28 10:16:35,346 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:16:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-02-28 10:16:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:35,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:35,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:37,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:37,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:37,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:37,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:37,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:37,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:37,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:37,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:37,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:37,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-28 10:16:37,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:37,623 INFO L442 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-02-28 10:16:37,623 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:37,632 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:37,632 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:16:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:40,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:44,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:44,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-02-28 10:16:44,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:44,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-28 10:16:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-28 10:16:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:16:44,581 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-02-28 10:16:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:48,856 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-02-28 10:16:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:16:48,856 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-02-28 10:16:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:48,857 INFO L225 Difference]: With dead ends: 330 [2019-02-28 10:16:48,857 INFO L226 Difference]: Without dead ends: 329 [2019-02-28 10:16:48,860 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-02-28 10:16:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-02-28 10:16:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-02-28 10:16:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-02-28 10:16:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-02-28 10:16:48,935 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-02-28 10:16:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:48,936 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-02-28 10:16:48,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-28 10:16:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-02-28 10:16:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-02-28 10:16:48,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:48,937 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-02-28 10:16:48,937 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:16:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-02-28 10:16:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:48,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:48,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:51,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:51,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:51,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:51,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:51,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:51,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:51,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:51,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 209 conjunts are in the unsatisfiable core [2019-02-28 10:16:51,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:51,319 INFO L442 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-02-28 10:16:51,319 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,324 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:51,325 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:16:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:54,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-02-28 10:16:58,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:58,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-28 10:16:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-28 10:16:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:16:58,123 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-02-28 10:17:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:02,323 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-28 10:17:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:17:02,323 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-02-28 10:17:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:02,325 INFO L225 Difference]: With dead ends: 335 [2019-02-28 10:17:02,325 INFO L226 Difference]: Without dead ends: 334 [2019-02-28 10:17:02,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-02-28 10:17:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-28 10:17:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-02-28 10:17:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-02-28 10:17:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-02-28 10:17:02,402 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-02-28 10:17:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:02,402 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-02-28 10:17:02,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-28 10:17:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-02-28 10:17:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-02-28 10:17:02,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:02,403 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-02-28 10:17:02,403 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:17:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-02-28 10:17:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:02,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:04,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:04,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:04,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:04,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:04,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:04,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:04,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:05,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:17:05,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:05,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:17:05,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:05,455 INFO L442 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-02-28 10:17:05,456 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:05,468 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:05,469 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:17:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:08,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:12,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:12,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-02-28 10:17:12,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:12,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:17:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:17:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:17:12,130 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-02-28 10:17:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:16,521 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-02-28 10:17:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:17:16,521 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-02-28 10:17:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:16,522 INFO L225 Difference]: With dead ends: 340 [2019-02-28 10:17:16,522 INFO L226 Difference]: Without dead ends: 339 [2019-02-28 10:17:16,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-02-28 10:17:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-02-28 10:17:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-02-28 10:17:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-02-28 10:17:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-02-28 10:17:16,603 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-02-28 10:17:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:16,603 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-02-28 10:17:16,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:17:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-02-28 10:17:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-02-28 10:17:16,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:16,605 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-02-28 10:17:16,605 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:17:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-02-28 10:17:16,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:16,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:16,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:19,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:19,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:19,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:19,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:19,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:19,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:19,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:19,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:19,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:19,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-28 10:17:19,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:19,424 INFO L442 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-02-28 10:17:19,424 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:19,434 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:19,434 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:17:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:22,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:26,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:26,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-02-28 10:17:26,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:26,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-28 10:17:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-28 10:17:26,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:17:26,582 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-02-28 10:17:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:31,022 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-02-28 10:17:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:17:31,022 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-02-28 10:17:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:31,023 INFO L225 Difference]: With dead ends: 345 [2019-02-28 10:17:31,023 INFO L226 Difference]: Without dead ends: 344 [2019-02-28 10:17:31,026 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-02-28 10:17:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-28 10:17:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-02-28 10:17:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-28 10:17:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-28 10:17:31,121 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-02-28 10:17:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:31,122 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-28 10:17:31,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-28 10:17:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-28 10:17:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-28 10:17:31,123 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:31,123 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-02-28 10:17:31,123 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:17:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-02-28 10:17:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:31,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:31,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:33,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:33,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:33,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:33,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:33,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:33,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:33,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:33,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:33,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 218 conjunts are in the unsatisfiable core [2019-02-28 10:17:33,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:33,759 INFO L442 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-02-28 10:17:33,759 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:33,770 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:33,770 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:17:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:36,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-02-28 10:17:40,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:40,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-28 10:17:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-28 10:17:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:17:40,985 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-02-28 10:17:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:45,660 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-02-28 10:17:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:17:45,661 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-02-28 10:17:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:45,662 INFO L225 Difference]: With dead ends: 350 [2019-02-28 10:17:45,662 INFO L226 Difference]: Without dead ends: 349 [2019-02-28 10:17:45,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-02-28 10:17:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-02-28 10:17:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-02-28 10:17:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-02-28 10:17:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-02-28 10:17:45,746 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-02-28 10:17:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:45,746 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-02-28 10:17:45,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-28 10:17:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-02-28 10:17:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-02-28 10:17:45,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:45,747 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-02-28 10:17:45,747 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:17:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-02-28 10:17:45,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:45,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:45,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:48,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:48,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:48,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:48,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:48,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:48,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-28 10:17:48,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:48,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-28 10:17:48,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:48,714 INFO L442 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-02-28 10:17:48,714 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:48,722 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:48,722 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:17:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:56,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:56,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-02-28 10:17:56,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:56,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:17:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:17:56,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:17:56,088 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-02-28 10:18:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:00,769 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-28 10:18:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:18:00,770 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-02-28 10:18:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:00,771 INFO L225 Difference]: With dead ends: 355 [2019-02-28 10:18:00,771 INFO L226 Difference]: Without dead ends: 354 [2019-02-28 10:18:00,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-02-28 10:18:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-28 10:18:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-02-28 10:18:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-02-28 10:18:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-02-28 10:18:00,859 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-02-28 10:18:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:00,859 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-02-28 10:18:00,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:18:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-02-28 10:18:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-02-28 10:18:00,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:00,860 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-02-28 10:18:00,860 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:18:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-02-28 10:18:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:00,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:00,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:00,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:03,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:03,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:03,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:03,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:03,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:03,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:03,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:03,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:03,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:03,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:03,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:18:03,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:03,589 INFO L442 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-02-28 10:18:03,590 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:03,673 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:03,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:18:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:07,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:11,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:11,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-02-28 10:18:11,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:11,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-28 10:18:11,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-28 10:18:11,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:18:11,481 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-02-28 10:18:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:16,392 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-02-28 10:18:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:18:16,393 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-02-28 10:18:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:16,394 INFO L225 Difference]: With dead ends: 360 [2019-02-28 10:18:16,394 INFO L226 Difference]: Without dead ends: 359 [2019-02-28 10:18:16,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-02-28 10:18:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-02-28 10:18:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-02-28 10:18:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-02-28 10:18:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-02-28 10:18:16,483 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-02-28 10:18:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:16,484 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-02-28 10:18:16,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-28 10:18:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-02-28 10:18:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-02-28 10:18:16,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:16,485 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-02-28 10:18:16,485 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:18:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-02-28 10:18:16,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:16,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:16,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:18,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:18,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:18,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:18,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:18,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:18,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:19,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:19,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 227 conjunts are in the unsatisfiable core [2019-02-28 10:18:19,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:19,228 INFO L442 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-02-28 10:18:19,228 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:19,238 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:19,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:18:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:22,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:26,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:26,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-02-28 10:18:26,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:26,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-28 10:18:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-28 10:18:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:18:26,895 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-02-28 10:18:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:31,918 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-02-28 10:18:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:18:31,919 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-02-28 10:18:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:31,920 INFO L225 Difference]: With dead ends: 365 [2019-02-28 10:18:31,920 INFO L226 Difference]: Without dead ends: 364 [2019-02-28 10:18:31,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-02-28 10:18:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-02-28 10:18:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-02-28 10:18:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-28 10:18:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-28 10:18:32,012 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-02-28 10:18:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:32,013 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-28 10:18:32,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-28 10:18:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-28 10:18:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-28 10:18:32,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:32,014 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-02-28 10:18:32,014 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:18:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-02-28 10:18:32,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:32,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:34,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:34,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:34,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:34,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:34,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:34,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:34,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:35,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-28 10:18:35,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:35,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-28 10:18:35,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:35,191 INFO L442 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-02-28 10:18:35,191 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:35,200 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:35,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:18:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:38,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:42,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:42,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-02-28 10:18:42,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:18:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:18:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:18:42,986 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-02-28 10:18:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:48,042 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-02-28 10:18:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:18:48,043 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-02-28 10:18:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:48,044 INFO L225 Difference]: With dead ends: 370 [2019-02-28 10:18:48,044 INFO L226 Difference]: Without dead ends: 369 [2019-02-28 10:18:48,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-02-28 10:18:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-02-28 10:18:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-02-28 10:18:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-28 10:18:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-02-28 10:18:48,139 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-02-28 10:18:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:48,140 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-02-28 10:18:48,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:18:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-02-28 10:18:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-02-28 10:18:48,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:48,141 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-02-28 10:18:48,141 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:18:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-02-28 10:18:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:48,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:48,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:50,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:50,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:50,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:50,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:50,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:50,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:51,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:51,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:51,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-28 10:18:51,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:51,062 INFO L442 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-02-28 10:18:51,063 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:51,070 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:51,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:18:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:54,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:58,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:58,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-02-28 10:18:58,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:58,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-28 10:18:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-28 10:18:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:18:58,598 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-02-28 10:19:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:03,744 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-28 10:19:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:19:03,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-02-28 10:19:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:03,746 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:19:03,746 INFO L226 Difference]: Without dead ends: 374 [2019-02-28 10:19:03,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-02-28 10:19:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-28 10:19:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-02-28 10:19:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-02-28 10:19:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-02-28 10:19:03,843 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-02-28 10:19:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:03,843 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-02-28 10:19:03,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-28 10:19:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-02-28 10:19:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-02-28 10:19:03,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:03,845 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-02-28 10:19:03,845 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:19:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-02-28 10:19:03,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:03,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:03,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:06,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:06,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:06,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:06,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:06,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:06,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:06,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:07,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 236 conjunts are in the unsatisfiable core [2019-02-28 10:19:07,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:07,127 INFO L442 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-02-28 10:19:07,127 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,133 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:07,133 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:19:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:10,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:14,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:14,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-02-28 10:19:14,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:14,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-28 10:19:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-28 10:19:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-02-28 10:19:14,949 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-02-28 10:19:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:20,273 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-02-28 10:19:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:19:20,274 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-02-28 10:19:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:20,275 INFO L225 Difference]: With dead ends: 380 [2019-02-28 10:19:20,275 INFO L226 Difference]: Without dead ends: 379 [2019-02-28 10:19:20,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-02-28 10:19:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-02-28 10:19:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-02-28 10:19:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-02-28 10:19:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-02-28 10:19:20,377 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-02-28 10:19:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:20,377 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-02-28 10:19:20,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-28 10:19:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-02-28 10:19:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-02-28 10:19:20,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:20,378 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-02-28 10:19:20,379 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:19:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-02-28 10:19:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:20,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:23,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:23,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:23,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:23,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:23,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:23,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:23,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:23,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:24,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-28 10:19:24,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:24,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-28 10:19:24,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:24,155 INFO L442 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-02-28 10:19:24,156 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:24,168 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:24,168 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:19:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:27,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:32,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:32,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-02-28 10:19:32,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:32,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:19:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:19:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:19:32,139 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-02-28 10:19:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:37,464 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-02-28 10:19:37,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:19:37,464 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-02-28 10:19:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:37,466 INFO L225 Difference]: With dead ends: 385 [2019-02-28 10:19:37,466 INFO L226 Difference]: Without dead ends: 384 [2019-02-28 10:19:37,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-02-28 10:19:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-02-28 10:19:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-02-28 10:19:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-28 10:19:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-28 10:19:37,568 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-02-28 10:19:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:37,569 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-28 10:19:37,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:19:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-28 10:19:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-28 10:19:37,570 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:37,570 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-02-28 10:19:37,570 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:19:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-02-28 10:19:37,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:37,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:37,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:37,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:37,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:40,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:40,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:40,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:40,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:40,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:40,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:40,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:40,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:40,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:40,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-28 10:19:40,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:40,674 INFO L442 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-02-28 10:19:40,674 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:40,685 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:40,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:19:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:44,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-02-28 10:19:48,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:48,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-28 10:19:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-28 10:19:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:19:48,875 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-02-28 10:19:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:54,468 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-02-28 10:19:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:19:54,468 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-02-28 10:19:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:54,470 INFO L225 Difference]: With dead ends: 390 [2019-02-28 10:19:54,470 INFO L226 Difference]: Without dead ends: 389 [2019-02-28 10:19:54,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-02-28 10:19:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-02-28 10:19:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-02-28 10:19:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-02-28 10:19:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-02-28 10:19:54,576 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-02-28 10:19:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:54,576 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-02-28 10:19:54,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-28 10:19:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-02-28 10:19:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-02-28 10:19:54,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:54,578 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-02-28 10:19:54,578 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:19:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-02-28 10:19:54,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:54,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:54,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:57,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:57,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:57,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:57,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:57,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:57,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:57,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:57,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 245 conjunts are in the unsatisfiable core [2019-02-28 10:19:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:57,978 INFO L442 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-02-28 10:19:57,978 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:57,985 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:57,985 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:20:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:01,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:05,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:05,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-02-28 10:20:05,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:05,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-28 10:20:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-28 10:20:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:20:05,982 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-02-28 10:20:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:11,634 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-28 10:20:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:20:11,634 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-02-28 10:20:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:11,636 INFO L225 Difference]: With dead ends: 395 [2019-02-28 10:20:11,636 INFO L226 Difference]: Without dead ends: 394 [2019-02-28 10:20:11,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-02-28 10:20:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-28 10:20:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-02-28 10:20:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-02-28 10:20:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-02-28 10:20:11,742 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-02-28 10:20:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:11,742 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-02-28 10:20:11,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-28 10:20:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-02-28 10:20:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-02-28 10:20:11,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:11,744 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-02-28 10:20:11,744 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:20:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-02-28 10:20:11,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:11,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:15,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:15,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:15,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:15,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:15,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:15,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:15,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:15,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:15,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-28 10:20:15,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:15,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-28 10:20:15,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:15,751 INFO L442 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-02-28 10:20:15,751 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:15,761 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:15,761 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:20:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:19,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:24,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:24,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-02-28 10:20:24,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:24,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:20:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:20:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-02-28 10:20:24,221 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-02-28 10:20:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:30,152 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-02-28 10:20:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:20:30,152 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-02-28 10:20:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:30,154 INFO L225 Difference]: With dead ends: 400 [2019-02-28 10:20:30,154 INFO L226 Difference]: Without dead ends: 399 [2019-02-28 10:20:30,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-02-28 10:20:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-02-28 10:20:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-02-28 10:20:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-28 10:20:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-02-28 10:20:30,309 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-02-28 10:20:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:30,309 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-02-28 10:20:30,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:20:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-02-28 10:20:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-02-28 10:20:30,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:30,311 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-02-28 10:20:30,311 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:20:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-02-28 10:20:30,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:30,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:30,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:33,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:33,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:33,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:33,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:33,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:33,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:33,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:33,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:34,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:34,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:34,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-28 10:20:34,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:34,149 INFO L442 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-02-28 10:20:34,149 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:34,159 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:34,159 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:20:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:37,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:42,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-02-28 10:20:42,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:42,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-28 10:20:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-28 10:20:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:20:42,340 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-02-28 10:20:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:48,333 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-02-28 10:20:48,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:20:48,334 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-02-28 10:20:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:48,335 INFO L225 Difference]: With dead ends: 405 [2019-02-28 10:20:48,335 INFO L226 Difference]: Without dead ends: 404 [2019-02-28 10:20:48,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-02-28 10:20:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-02-28 10:20:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-02-28 10:20:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-28 10:20:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-28 10:20:48,455 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-02-28 10:20:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:48,455 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-28 10:20:48,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-28 10:20:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-28 10:20:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-28 10:20:48,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:48,457 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-02-28 10:20:48,457 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:20:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-02-28 10:20:48,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:48,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:48,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:51,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:51,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:51,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:51,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:51,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:51,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:51,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:51,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 254 conjunts are in the unsatisfiable core [2019-02-28 10:20:51,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:51,947 INFO L442 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-02-28 10:20:51,947 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:51,958 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:51,958 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:20:55,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-02-28 10:20:55,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:00,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:00,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-02-28 10:21:00,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:00,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-28 10:21:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-28 10:21:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:21:00,507 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-02-28 10:21:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:06,507 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-02-28 10:21:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:21:06,507 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-02-28 10:21:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:06,509 INFO L225 Difference]: With dead ends: 410 [2019-02-28 10:21:06,509 INFO L226 Difference]: Without dead ends: 409 [2019-02-28 10:21:06,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-02-28 10:21:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-02-28 10:21:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-02-28 10:21:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-02-28 10:21:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-02-28 10:21:06,626 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-02-28 10:21:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:06,626 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-02-28 10:21:06,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-28 10:21:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-02-28 10:21:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-02-28 10:21:06,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:06,628 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-02-28 10:21:06,628 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:21:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-02-28 10:21:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:06,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:06,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:10,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:10,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:10,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:10,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:10,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:10,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:10,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:10,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:10,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-28 10:21:10,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:10,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-28 10:21:10,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:10,845 INFO L442 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-02-28 10:21:10,845 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:10,853 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:10,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:21:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:14,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:19,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:19,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-02-28 10:21:19,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:19,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-28 10:21:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-28 10:21:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:21:19,313 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-02-28 10:21:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:25,816 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-02-28 10:21:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:21:25,816 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-02-28 10:21:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:25,818 INFO L225 Difference]: With dead ends: 415 [2019-02-28 10:21:25,818 INFO L226 Difference]: Without dead ends: 414 [2019-02-28 10:21:25,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-02-28 10:21:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-02-28 10:21:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-02-28 10:21:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-02-28 10:21:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-02-28 10:21:25,941 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-02-28 10:21:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:25,941 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-02-28 10:21:25,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-28 10:21:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-02-28 10:21:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-02-28 10:21:25,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:25,943 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-02-28 10:21:25,943 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:21:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-02-28 10:21:25,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:25,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:25,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:25,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:29,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:29,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:29,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:29,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:29,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:29,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:29,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:29,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:29,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-28 10:21:29,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:29,504 INFO L442 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-02-28 10:21:29,504 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:29,514 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:29,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:21:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:33,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:38,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:38,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-02-28 10:21:38,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:38,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-28 10:21:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-28 10:21:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:21:38,186 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-02-28 10:21:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:44,563 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-02-28 10:21:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:21:44,564 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-02-28 10:21:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:44,565 INFO L225 Difference]: With dead ends: 420 [2019-02-28 10:21:44,565 INFO L226 Difference]: Without dead ends: 419 [2019-02-28 10:21:44,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-02-28 10:21:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-02-28 10:21:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-02-28 10:21:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-02-28 10:21:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-02-28 10:21:44,691 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-02-28 10:21:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:44,691 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-02-28 10:21:44,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-28 10:21:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-02-28 10:21:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-02-28 10:21:44,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:44,693 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-02-28 10:21:44,693 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:21:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-02-28 10:21:44,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:44,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:44,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:44,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:44,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:48,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:48,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:48,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:48,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:48,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:48,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:48,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:48,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 263 conjunts are in the unsatisfiable core [2019-02-28 10:21:48,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:48,381 INFO L442 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-02-28 10:21:48,381 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:48,391 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:48,391 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:21:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:52,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:57,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:57,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-02-28 10:21:57,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:57,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-28 10:21:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-28 10:21:57,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:21:57,244 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-02-28 10:22:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:03,764 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-02-28 10:22:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:22:03,764 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-02-28 10:22:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:03,766 INFO L225 Difference]: With dead ends: 425 [2019-02-28 10:22:03,766 INFO L226 Difference]: Without dead ends: 424 [2019-02-28 10:22:03,768 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-02-28 10:22:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-28 10:22:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-02-28 10:22:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-02-28 10:22:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-02-28 10:22:03,896 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-02-28 10:22:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:03,896 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-02-28 10:22:03,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-28 10:22:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-02-28 10:22:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-02-28 10:22:03,898 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:03,898 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-02-28 10:22:03,898 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:22:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-02-28 10:22:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:07,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:07,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:07,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:07,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:07,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:07,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:07,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:08,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-28 10:22:08,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:08,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-28 10:22:08,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:08,603 INFO L442 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-02-28 10:22:08,603 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:08,612 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:08,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:22:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:13,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:17,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:17,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-02-28 10:22:17,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:17,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-28 10:22:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-28 10:22:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-02-28 10:22:17,667 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-02-28 10:22:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:24,560 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-02-28 10:22:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:22:24,561 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-02-28 10:22:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:24,562 INFO L225 Difference]: With dead ends: 430 [2019-02-28 10:22:24,563 INFO L226 Difference]: Without dead ends: 429 [2019-02-28 10:22:24,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-02-28 10:22:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-02-28 10:22:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-02-28 10:22:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-02-28 10:22:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-02-28 10:22:24,695 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-02-28 10:22:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:24,695 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-02-28 10:22:24,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-28 10:22:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-02-28 10:22:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-02-28 10:22:24,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:24,698 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-02-28 10:22:24,698 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:22:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-02-28 10:22:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:24,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:24,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:28,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:28,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:28,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:28,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:28,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:28,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:28,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:28,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-28 10:22:28,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:28,747 INFO L442 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-02-28 10:22:28,747 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,758 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:22:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:37,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:37,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-02-28 10:22:37,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:37,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-28 10:22:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-28 10:22:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:22:37,950 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-02-28 10:22:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:44,886 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-02-28 10:22:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:22:44,886 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-02-28 10:22:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:44,888 INFO L225 Difference]: With dead ends: 435 [2019-02-28 10:22:44,888 INFO L226 Difference]: Without dead ends: 434 [2019-02-28 10:22:44,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-02-28 10:22:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-02-28 10:22:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-02-28 10:22:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-02-28 10:22:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-02-28 10:22:45,030 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-02-28 10:22:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:45,030 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-02-28 10:22:45,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-28 10:22:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-02-28 10:22:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-02-28 10:22:45,032 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:45,032 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-02-28 10:22:45,032 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:22:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-02-28 10:22:45,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:48,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:48,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:48,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:48,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:48,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 272 conjunts are in the unsatisfiable core [2019-02-28 10:22:49,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:49,083 INFO L442 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-02-28 10:22:49,083 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,091 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:22:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:58,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-02-28 10:22:58,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:58,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-28 10:22:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-28 10:22:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13931, Invalid=22359, Unknown=0, NotChecked=0, Total=36290 [2019-02-28 10:22:58,357 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-02-28 10:23:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:05,079 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-02-28 10:23:05,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:23:05,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-02-28 10:23:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:05,081 INFO L225 Difference]: With dead ends: 440 [2019-02-28 10:23:05,081 INFO L226 Difference]: Without dead ends: 439 [2019-02-28 10:23:05,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 684 SyntacticMatches, 72 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35812 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=26891, Invalid=50115, Unknown=0, NotChecked=0, Total=77006 [2019-02-28 10:23:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-02-28 10:23:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-02-28 10:23:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-02-28 10:23:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-02-28 10:23:05,218 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-02-28 10:23:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:05,218 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-02-28 10:23:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-28 10:23:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-02-28 10:23:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-02-28 10:23:05,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:05,220 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-02-28 10:23:05,220 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:23:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-02-28 10:23:05,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:05,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:09,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:09,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:09,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:09,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:09,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:10,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-28 10:23:10,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:10,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-28 10:23:10,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:10,477 INFO L442 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-02-28 10:23:10,477 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,487 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:23:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,192 INFO L322 TraceCheckSpWp]: Computing backward predicates...