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_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:27,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:27,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:27,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:27,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:27,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:27,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:27,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:27,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:27,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:27,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:27,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:27,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:27,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:27,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:27,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:27,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:27,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:27,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:27,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:27,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:27,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:27,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:27,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:27,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:27,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:27,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:27,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:27,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:27,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:27,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:27,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:27,247 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:27,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:27,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:27,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:27,250 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:27,273 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:27,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:27,275 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:27,275 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:27,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:27,275 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:27,276 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:27,276 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:27,276 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:27,277 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:27,277 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:27,277 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:27,277 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:27,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:27,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:27,278 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:27,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:27,279 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:27,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:27,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:27,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:27,280 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:27,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:27,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:27,281 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:27,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:27,281 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:27,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:27,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:27,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:27,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:27,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:27,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:27,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:27,284 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:27,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:27,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:27,284 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:27,284 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:27,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:27,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:27,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:27,357 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:27,358 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:27,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-03-04 16:38:27,359 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-03-04 16:38:27,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:27,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:27,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:27,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:27,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:27,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,451 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:38:27,451 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:38:27,451 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:38:27,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:27,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:27,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:27,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:27,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/1) ... [2019-03-04 16:38:27,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:27,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:27,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:27,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:27,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38: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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:38:27,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:38:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:38:27,831 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:38:27,832 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-03-04 16:38:27,833 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:27 BoogieIcfgContainer [2019-03-04 16:38:27,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:27,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:27,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:27,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:27,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:27" (1/2) ... [2019-03-04 16:38:27,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455a25bd and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:27, skipping insertion in model container [2019-03-04 16:38:27,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:27" (2/2) ... [2019-03-04 16:38:27,842 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-03-04 16:38:27,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:27,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:27,879 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:27,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:27,915 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:27,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:27,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:27,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:27,916 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:27,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:27,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:38:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:27,952 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:27,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:27,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:38:27,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:28,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:28,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:28,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:28,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:28,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:28,236 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:38:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:28,369 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-03-04 16:38:28,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:28,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:28,390 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:38:28,391 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:38:28,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-04 16:38:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:38:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:38:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:38:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:38:28,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-03-04 16:38:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:28,438 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:38:28,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:38:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:28,439 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:28,440 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:38:28,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-03-04 16:38:28,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:28,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:28,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:28,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:28,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:28,672 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-03-04 16:38:28,741 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:28,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:28,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:29,001 INFO L272 AbstractInterpreter]: Visited 5 different actions 38 times. Merged at 4 different actions 33 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:29,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:29,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,010 INFO 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-03-04 16:38:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:29,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:29,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:38:29,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:29,189 INFO L453 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-03-04 16:38:29,189 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,214 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:29,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:29,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:29,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:29,433 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-03-04 16:38:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:29,529 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:38:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:38:29,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-03-04 16:38:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:29,530 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:38:29,530 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:38:29,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:38:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-03-04 16:38:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:38:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-03-04 16:38:29,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-03-04 16:38:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:29,537 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-03-04 16:38:29,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-03-04 16:38:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:29,538 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:29,538 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-03-04 16:38:29,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-03-04 16:38:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:29,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:29,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:29,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:29,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:29,633 INFO 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-03-04 16:38:29,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:29,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:29,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:38:29,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:29,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:38:29,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:29,748 INFO L453 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-03-04 16:38:29,748 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:30,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:30,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:30,118 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-03-04 16:38:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:30,261 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-03-04 16:38:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:30,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:38:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:30,263 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:38:30,263 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:38:30,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:38:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:38:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:38:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-03-04 16:38:30,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-03-04 16:38:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-03-04 16:38:30,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-03-04 16:38:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:38:30,269 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:30,269 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-03-04 16:38:30,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-03-04 16:38:30,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:30,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:30,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:30,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:30,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:30,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:30,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:30,383 INFO 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-03-04 16:38:30,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:30,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:30,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:30,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:30,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:38:30,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:30,437 INFO L453 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-03-04 16:38:30,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:30,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:30,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:30,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:30,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:30,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:30,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:30,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:30,712 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-03-04 16:38:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:31,001 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-03-04 16:38:31,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:31,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-03-04 16:38:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:31,002 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:38:31,002 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:38:31,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:38:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:38:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:38:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-03-04 16:38:31,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-03-04 16:38:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:31,006 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-03-04 16:38:31,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-03-04 16:38:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-03-04 16:38:31,007 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:31,007 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-03-04 16:38:31,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-03-04 16:38:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:31,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:31,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:31,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:31,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:31,117 INFO 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-03-04 16:38:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:31,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:31,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:38:31,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:31,154 INFO L453 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-03-04 16:38:31,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,169 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:38:31,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:31,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:38:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:38:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:31,397 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-03-04 16:38:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:31,473 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-03-04 16:38:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:31,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-03-04 16:38:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:31,476 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:31,477 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:31,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-03-04 16:38:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:38:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-03-04 16:38:31,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-03-04 16:38:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:31,483 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-03-04 16:38:31,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:38:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-03-04 16:38:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-03-04 16:38:31,484 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:31,484 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-03-04 16:38:31,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-03-04 16:38:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:31,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:31,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:31,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:31,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:31,703 INFO 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-03-04 16:38:31,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:31,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:31,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:38:31,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:31,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:38:31,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:31,743 INFO L453 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-03-04 16:38:31,744 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,755 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,756 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:31,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:38:32,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:32,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:38:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:38:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:38:32,068 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-03-04 16:38:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:32,120 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-03-04 16:38:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:32,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-03-04 16:38:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:32,122 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:38:32,122 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:38:32,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:38:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:38:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-03-04 16:38:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:38:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-03-04 16:38:32,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-03-04 16:38:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:32,128 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-03-04 16:38:32,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:38:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-03-04 16:38:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-03-04 16:38:32,129 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:32,129 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-03-04 16:38:32,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-03-04 16:38:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:32,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:32,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:32,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:32,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:32,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,252 INFO 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-03-04 16:38:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:32,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:32,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:32,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:32,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:38:32,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:32,283 INFO L453 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-03-04 16:38:32,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,294 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-03-04 16:38:32,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:32,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:38:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:38:32,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:38:32,548 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-03-04 16:38:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:32,614 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-03-04 16:38:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:38:32,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-03-04 16:38:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:32,616 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:38:32,616 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:38:32,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:38:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:38:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-03-04 16:38:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:38:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-03-04 16:38:32,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-03-04 16:38:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:32,622 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-03-04 16:38:32,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:38:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-03-04 16:38:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-03-04 16:38:32,623 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:32,624 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-03-04 16:38:32,624 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-03-04 16:38:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:32,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:32,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:32,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:32,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:32,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,860 INFO 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-03-04 16:38:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:32,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:32,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:38:32,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:32,911 INFO L453 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-03-04 16:38:32,911 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,927 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:33,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:33,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-03-04 16:38:33,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:33,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:38:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:38:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:38:33,339 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-03-04 16:38:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:33,650 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-03-04 16:38:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:38:33,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-03-04 16:38:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:33,657 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:38:33,657 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:38:33,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:38:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:38:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-03-04 16:38:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:38:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-03-04 16:38:33,663 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-03-04 16:38:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:33,663 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-03-04 16:38:33,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:38:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-03-04 16:38:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:38:33,664 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:33,665 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-03-04 16:38:33,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-03-04 16:38:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:33,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:33,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:33,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:33,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:33,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:33,830 INFO 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-03-04 16:38:33,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:33,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:33,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:38:33,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:33,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:38:33,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:33,892 INFO L453 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-03-04 16:38:33,893 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:33,901 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:33,902 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:34,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-03-04 16:38:34,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:34,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:38:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:38:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:38:34,293 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-03-04 16:38:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:34,398 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-03-04 16:38:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:38:34,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-03-04 16:38:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:34,400 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:38:34,400 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:38:34,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:38:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:38:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-03-04 16:38:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:38:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-03-04 16:38:34,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-03-04 16:38:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:34,407 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-03-04 16:38:34,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:38:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-03-04 16:38:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:38:34,408 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:34,408 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-03-04 16:38:34,408 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-03-04 16:38:34,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:34,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:34,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:34,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:34,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:34,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:34,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:34,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:34,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:34,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:34,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:34,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:34,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:34,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:38:34,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:34,671 INFO L453 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-03-04 16:38:34,671 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:34,675 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:34,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:35,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-03-04 16:38:35,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:38:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:38:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:38:35,523 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-03-04 16:38:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:35,597 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-03-04 16:38:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:38:35,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-03-04 16:38:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:35,599 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:38:35,606 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:38:35,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:38:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:38:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:38:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:38:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-03-04 16:38:35,612 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-03-04 16:38:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:35,612 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-03-04 16:38:35,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:38:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-03-04 16:38:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-03-04 16:38:35,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:35,614 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-03-04 16:38:35,614 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-03-04 16:38:35,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:35,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:35,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:35,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:35,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:35,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:35,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:38:35,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:35,854 INFO L453 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-03-04 16:38:35,854 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:35,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:36,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-03-04 16:38:36,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:36,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:38:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:38:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:38:36,391 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-03-04 16:38:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:36,493 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-03-04 16:38:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:38:36,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-03-04 16:38:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:36,496 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:36,497 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:38:36,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:38:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:38:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-03-04 16:38:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:38:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-03-04 16:38:36,502 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-03-04 16:38:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:36,502 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-03-04 16:38:36,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:38:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-03-04 16:38:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-03-04 16:38:36,504 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:36,504 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-03-04 16:38:36,504 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-03-04 16:38:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:36,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:36,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:36,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:36,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:36,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:36,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:36,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:36,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-03-04 16:38:36,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:38:36,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:36,830 INFO L453 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-03-04 16:38:36,831 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:36,837 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-03-04 16:38:37,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:37,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:38:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:38:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:38:37,419 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-03-04 16:38:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:37,537 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-03-04 16:38:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:38:37,537 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-03-04 16:38:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:37,538 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:38:37,538 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:38:37,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:38:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:38:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-03-04 16:38:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:38:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-03-04 16:38:37,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-03-04 16:38:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:37,546 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-03-04 16:38:37,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:38:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-03-04 16:38:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-03-04 16:38:37,547 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:37,547 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-03-04 16:38:37,547 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-03-04 16:38:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:37,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:37,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:37,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:37,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:37,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:37,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:37,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:37,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,000 INFO 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-03-04 16:38:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:38,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:38,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:38,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:38,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,034 INFO L453 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-03-04 16:38:38,034 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,042 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,043 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:38,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-03-04 16:38:38,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:38,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:38:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:38:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:38:38,544 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-03-04 16:38:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:38,625 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-03-04 16:38:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:38:38,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-03-04 16:38:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:38,627 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:38,627 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:38,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:38:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-03-04 16:38:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:38:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-03-04 16:38:38,632 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-03-04 16:38:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:38,632 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-03-04 16:38:38,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:38:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-03-04 16:38:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-03-04 16:38:38,633 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:38,634 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-03-04 16:38:38,634 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-03-04 16:38:38,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:38,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:38,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:38,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:38,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:38,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:38,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:38,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:38,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:38:38,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:38,915 INFO L453 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-03-04 16:38:38,916 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:38,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:39,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-03-04 16:38:40,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:40,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:38:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:38:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:38:40,087 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-03-04 16:38:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:40,198 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-03-04 16:38:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:38:40,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-03-04 16:38:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:40,200 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:38:40,200 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:38:40,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:38:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:38:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-03-04 16:38:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:38:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-03-04 16:38:40,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-03-04 16:38:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:40,207 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-03-04 16:38:40,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:38:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-03-04 16:38:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-03-04 16:38:40,208 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:40,208 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-03-04 16:38:40,209 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-03-04 16:38:40,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:40,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:40,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:40,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:40,529 INFO 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-03-04 16:38:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:40,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:40,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:38:40,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:40,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:38:40,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:40,621 INFO L453 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-03-04 16:38:40,622 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,636 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:40,636 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-03-04 16:38:41,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:38:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:38:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:38:41,968 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-03-04 16:38:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:42,220 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-03-04 16:38:42,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:38:42,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-03-04 16:38:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:42,221 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:38:42,221 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:38:42,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:38:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:38:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-03-04 16:38:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:38:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-03-04 16:38:42,234 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-03-04 16:38:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:42,234 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-03-04 16:38:42,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:38:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-03-04 16:38:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:38:42,235 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:42,236 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-03-04 16:38:42,238 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-03-04 16:38:42,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:42,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:43,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:43,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:43,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,324 INFO 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-03-04 16:38:43,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:43,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:43,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:43,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:43,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:38:43,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:43,364 INFO L453 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-03-04 16:38:43,364 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,373 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,373 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:43,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-03-04 16:38:43,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:43,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:38:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:38:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:38:43,949 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-03-04 16:38:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,054 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-03-04 16:38:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:38:44,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-03-04 16:38:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,055 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:38:44,056 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:38:44,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:38:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:38:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-03-04 16:38:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:38:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-03-04 16:38:44,062 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-03-04 16:38:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,062 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-03-04 16:38:44,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:38:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-03-04 16:38:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:38:44,063 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,063 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-03-04 16:38:44,063 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-03-04 16:38:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:44,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:44,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,445 INFO 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-03-04 16:38:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:38:44,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:44,486 INFO L453 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-03-04 16:38:44,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,490 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:46,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-03-04 16:38:46,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:38:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:38:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:38:46,556 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-03-04 16:38:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:46,687 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-03-04 16:38:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:38:46,687 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-03-04 16:38:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:46,688 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:38:46,688 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:38:46,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:38:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:38:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-03-04 16:38:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:38:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-03-04 16:38:46,695 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-03-04 16:38:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:46,696 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-03-04 16:38:46,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:38:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-03-04 16:38:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-03-04 16:38:46,697 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:46,697 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-03-04 16:38:46,697 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:46,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-03-04 16:38:46,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:46,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:46,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:46,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:46,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:47,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:47,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:47,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,395 INFO 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-03-04 16:38:47,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:47,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:47,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:38:47,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:47,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:38:47,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:47,482 INFO L453 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-03-04 16:38:47,482 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,521 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:48,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:48,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-03-04 16:38:48,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:48,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:38:48,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:38:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:38:48,669 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-03-04 16:38:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:48,802 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-03-04 16:38:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:38:48,802 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-03-04 16:38:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:48,803 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:38:48,803 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:38:48,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:38:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:38:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-03-04 16:38:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:38:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-03-04 16:38:48,809 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-03-04 16:38:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:48,809 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-03-04 16:38:48,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:38:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-03-04 16:38:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-03-04 16:38:48,810 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:48,810 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-03-04 16:38:48,810 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-03-04 16:38:48,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:48,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:48,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:49,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:49,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:49,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:49,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:49,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:49,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:49,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:49,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:38:49,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,235 INFO L453 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-03-04 16:38:49,236 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:50,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-03-04 16:38:50,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:50,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:38:50,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:38:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:38:50,016 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-03-04 16:38:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:50,144 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-03-04 16:38:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:38:50,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-03-04 16:38:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:50,145 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:38:50,146 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:38:50,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:38:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:38:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-03-04 16:38:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:38:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:38:50,153 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-03-04 16:38:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:50,153 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:38:50,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:38:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:38:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:38:50,154 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:50,154 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-03-04 16:38:50,155 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-03-04 16:38:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:50,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:50,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,469 INFO 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-03-04 16:38:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:50,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:50,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:38:50,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:50,526 INFO L453 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-03-04 16:38:50,527 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,531 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,531 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:51,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-03-04 16:38:51,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:51,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:38:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:38:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:38:51,399 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-03-04 16:38:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:51,554 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-03-04 16:38:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:38:51,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-03-04 16:38:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:51,555 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:38:51,555 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:38:51,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:38:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:38:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-03-04 16:38:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:38:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-03-04 16:38:51,562 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-03-04 16:38:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:51,562 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-03-04 16:38:51,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:38:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-03-04 16:38:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-03-04 16:38:51,563 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:51,564 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-03-04 16:38:51,564 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:51,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-03-04 16:38:51,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:51,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:51,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:51,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:51,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:51,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:51,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:51,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,887 INFO 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-03-04 16:38:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:51,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:51,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-03-04 16:38:51,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:51,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:38:51,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:51,959 INFO L453 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-03-04 16:38:51,959 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,970 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:54,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:54,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-03-04 16:38:54,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:54,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:38:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:38:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:38:54,035 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-03-04 16:38:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:54,169 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-03-04 16:38:54,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:38:54,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-03-04 16:38:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:54,170 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:38:54,171 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:38:54,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:38:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:38:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-03-04 16:38:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:38:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-03-04 16:38:54,177 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-03-04 16:38:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:54,178 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-03-04 16:38:54,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:38:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-03-04 16:38:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-03-04 16:38:54,179 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:54,179 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-03-04 16:38:54,179 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-03-04 16:38:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:54,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:54,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:54,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:54,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:54,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:54,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:54,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:54,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:38:54,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:54,680 INFO L453 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-03-04 16:38:54,681 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,710 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:55,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-03-04 16:38:55,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:55,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:38:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:38:55,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:38:55,732 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-03-04 16:38:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:55,871 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-03-04 16:38:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:38:55,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-03-04 16:38:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:55,875 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:38:55,875 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:38:55,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:38:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:38:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-03-04 16:38:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:38:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-03-04 16:38:55,879 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-03-04 16:38:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:55,880 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-03-04 16:38:55,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:38:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-03-04 16:38:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-03-04 16:38:55,880 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:55,880 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-03-04 16:38:55,881 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-03-04 16:38:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:56,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:56,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:56,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:56,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:56,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:56,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:38:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:56,929 INFO L453 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-03-04 16:38:56,930 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,937 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,938 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:57,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:58,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-03-04 16:38:58,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:58,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:38:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:38:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:38:58,118 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-03-04 16:38:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:58,336 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:38:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:38:58,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-03-04 16:38:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:58,337 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:38:58,337 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:38:58,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:38:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:38:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-03-04 16:38:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:38:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-03-04 16:38:58,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-03-04 16:38:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:58,341 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-03-04 16:38:58,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:38:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-03-04 16:38:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:38:58,342 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:58,342 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-03-04 16:38:58,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-03-04 16:38:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:58,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:58,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:58,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,826 INFO 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-03-04 16:38:58,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:58,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:58,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:38:58,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:58,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:38:58,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:58,891 INFO L453 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-03-04 16:38:58,891 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,911 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:38:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:00,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:00,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-03-04 16:39:00,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:39:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:39:00,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:39:00,081 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-03-04 16:39:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:00,260 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-03-04 16:39:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:39:00,260 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-03-04 16:39:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:00,261 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:39:00,261 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:39:00,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:39:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:39:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-03-04 16:39:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:39:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-03-04 16:39:00,266 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-03-04 16:39:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:00,266 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-03-04 16:39:00,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:39:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-03-04 16:39:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-03-04 16:39:00,267 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:00,267 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-03-04 16:39:00,268 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-03-04 16:39:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:00,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:00,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:00,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:00,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,718 INFO 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-03-04 16:39:00,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:00,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:00,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:00,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:00,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:39:00,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:00,761 INFO L453 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-03-04 16:39:00,761 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,768 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,769 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:02,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-03-04 16:39:02,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:02,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:39:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:39:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:39:02,158 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-03-04 16:39:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:02,364 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-03-04 16:39:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:39:02,364 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-03-04 16:39:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:02,365 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:39:02,365 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:39:02,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:39:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:39:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-03-04 16:39:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:39:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-03-04 16:39:02,371 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-03-04 16:39:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:02,372 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-03-04 16:39:02,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:39:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-03-04 16:39:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-03-04 16:39:02,373 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:02,373 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-03-04 16:39:02,373 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-03-04 16:39:02,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:02,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:02,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:02,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,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 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-03-04 16:39:02,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:39:02,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:02,910 INFO L453 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-03-04 16:39:02,910 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,914 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:03,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:04,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-03-04 16:39:04,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:04,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:39:04,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:39:04,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:39:04,466 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-03-04 16:39:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:04,665 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-03-04 16:39:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:39:04,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-03-04 16:39:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:04,666 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:39:04,666 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:39:04,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:39:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:39:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-03-04 16:39:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:39:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-03-04 16:39:04,672 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-03-04 16:39:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:04,672 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-03-04 16:39:04,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:39:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-03-04 16:39:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-03-04 16:39:04,674 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:04,674 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-03-04 16:39:04,674 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-03-04 16:39:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:05,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:05,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:05,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:05,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:05,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:05,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:05,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:39:05,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:05,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:39:05,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:05,289 INFO L453 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-03-04 16:39:05,289 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,301 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,301 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:06,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-03-04 16:39:06,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:06,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:39:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:39:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:39:06,992 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-03-04 16:39:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:07,155 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-03-04 16:39:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:39:07,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-03-04 16:39:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:07,157 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:39:07,157 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:39:07,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:39:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:39:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-03-04 16:39:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:39:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-03-04 16:39:07,162 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-03-04 16:39:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-03-04 16:39:07,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:39:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-03-04 16:39:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-03-04 16:39:07,163 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:07,164 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-03-04 16:39:07,164 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-03-04 16:39:07,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:07,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:07,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:07,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:07,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:07,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:07,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:07,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:07,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:39:07,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:07,720 INFO L453 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-03-04 16:39:07,720 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,730 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,731 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:09,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-03-04 16:39:09,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:09,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:39:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:39:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:39:09,562 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-03-04 16:39:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:09,740 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-03-04 16:39:09,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:39:09,741 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-03-04 16:39:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:09,742 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:39:09,742 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:39:09,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:39:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:39:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-03-04 16:39:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:39:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-03-04 16:39:09,748 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-03-04 16:39:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:09,749 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-03-04 16:39:09,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:39:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-03-04 16:39:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-03-04 16:39:09,750 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:09,750 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-03-04 16:39:09,750 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-03-04 16:39:09,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:09,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:09,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:09,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:10,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:10,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:10,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,483 INFO 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-03-04 16:39:10,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 94 conjunts are in the unsatisfiable core [2019-03-04 16:39:10,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,526 INFO L453 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-03-04 16:39:10,527 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,536 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-03-04 16:39:12,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:39:12,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:39:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:39:12,461 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-03-04 16:39:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:12,670 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-03-04 16:39:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:39:12,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-03-04 16:39:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:12,672 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:39:12,672 INFO L226 Difference]: Without dead ends: 92 [2019-03-04 16:39:12,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:39:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-03-04 16:39:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-03-04 16:39:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:39:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-03-04 16:39:12,677 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-03-04 16:39:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:12,677 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-03-04 16:39:12,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:39:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-03-04 16:39:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:39:12,678 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:12,678 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-03-04 16:39:12,678 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-03-04 16:39:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:13,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:13,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:13,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,218 INFO 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-03-04 16:39:13,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:13,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:13,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:39:13,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:13,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:39:13,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:13,316 INFO L453 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-03-04 16:39:13,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,322 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-03-04 16:39:15,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:39:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:39:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:39:15,404 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-03-04 16:39:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:15,587 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-03-04 16:39:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:39:15,588 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-03-04 16:39:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:15,589 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:39:15,589 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:39:15,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:39:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:39:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-03-04 16:39:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:39:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-03-04 16:39:15,594 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-03-04 16:39:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:15,594 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-03-04 16:39:15,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:39:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-03-04 16:39:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:39:15,594 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:15,595 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-03-04 16:39:15,595 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-03-04 16:39:15,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:16,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:16,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:16,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,189 INFO 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-03-04 16:39:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:16,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:16,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:16,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:16,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:39:16,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:16,240 INFO L453 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-03-04 16:39:16,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,254 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:18,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:18,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-03-04 16:39:18,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:18,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:39:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:39:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:39:18,072 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-03-04 16:39:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:18,260 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-03-04 16:39:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:39:18,260 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-03-04 16:39:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:18,261 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:39:18,261 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:39:18,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:39:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:39:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-03-04 16:39:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:39:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-03-04 16:39:18,266 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-03-04 16:39:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:18,267 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-03-04 16:39:18,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:39:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-03-04 16:39:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-03-04 16:39:18,267 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:18,268 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-03-04 16:39:18,268 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-03-04 16:39:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:19,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:19,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:19,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:19,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:19,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:39:19,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:19,181 INFO L453 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-03-04 16:39:19,181 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,192 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,192 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-03-04 16:39:21,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:39:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:39:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:39:21,185 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-03-04 16:39:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:21,383 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-03-04 16:39:21,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:39:21,384 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-03-04 16:39:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:21,385 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:39:21,385 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:39:21,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:39:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:39:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-03-04 16:39:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:39:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-03-04 16:39:21,390 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-03-04 16:39:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:21,390 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-03-04 16:39:21,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:39:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-03-04 16:39:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-03-04 16:39:21,391 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:21,391 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-03-04 16:39:21,392 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-03-04 16:39:21,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:22,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:22,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,006 INFO 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-03-04 16:39:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:22,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:22,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-03-04 16:39:22,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:22,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,095 INFO L453 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-03-04 16:39:22,095 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,103 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,103 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:24,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-03-04 16:39:24,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:24,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:39:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:39:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:39:24,657 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-03-04 16:39:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:24,913 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-03-04 16:39:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:39:24,914 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-03-04 16:39:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:24,915 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:39:24,915 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:39:24,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:39:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:39:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-03-04 16:39:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:39:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-03-04 16:39:24,921 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-03-04 16:39:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:24,921 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-03-04 16:39:24,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:39:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-03-04 16:39:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-03-04 16:39:24,922 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:24,922 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-03-04 16:39:24,922 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-03-04 16:39:24,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:24,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:24,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:25,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:25,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:25,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,671 INFO 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-03-04 16:39:25,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:25,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:25,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:25,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:25,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:39:25,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:25,745 INFO L453 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-03-04 16:39:25,746 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,842 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,842 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:28,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-03-04 16:39:28,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:28,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:39:28,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:39:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:39:28,173 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-03-04 16:39:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:28,441 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-03-04 16:39:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:39:28,441 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-03-04 16:39:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:28,442 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:39:28,443 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:39:28,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:39:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:39:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-03-04 16:39:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:39:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-03-04 16:39:28,448 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-03-04 16:39:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:28,448 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-03-04 16:39:28,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:39:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-03-04 16:39:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-03-04 16:39:28,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:28,449 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-03-04 16:39:28,449 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-03-04 16:39:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:29,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:29,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:29,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,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 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-03-04 16:39:29,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:29,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:29,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 112 conjunts are in the unsatisfiable core [2019-03-04 16:39:29,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:29,600 INFO L453 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-03-04 16:39:29,600 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,614 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:31,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-03-04 16:39:31,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:31,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:39:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:39:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:39:31,911 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-03-04 16:39:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:32,147 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-03-04 16:39:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:39:32,148 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-03-04 16:39:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:32,149 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:39:32,149 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:39:32,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:39:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:39:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-03-04 16:39:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:39:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-03-04 16:39:32,154 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-03-04 16:39:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:32,154 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-03-04 16:39:32,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:39:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-03-04 16:39:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-03-04 16:39:32,154 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:32,155 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-03-04 16:39:32,155 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-03-04 16:39:32,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:32,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:32,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:32,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:32,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:32,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,831 INFO 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-03-04 16:39:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:32,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:32,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:39:32,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:32,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:39:32,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:32,939 INFO L453 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-03-04 16:39:32,940 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,947 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:35,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-03-04 16:39:35,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:35,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:39:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:39:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:39:35,790 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-03-04 16:39:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:36,202 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-03-04 16:39:36,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:39:36,203 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-03-04 16:39:36,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:36,204 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:39:36,204 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:39:36,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:39:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:39:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-03-04 16:39:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:39:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-03-04 16:39:36,209 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-03-04 16:39:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:36,210 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-03-04 16:39:36,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:39:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-03-04 16:39:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:39:36,210 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:36,211 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-03-04 16:39:36,211 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-03-04 16:39:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:37,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:37,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:37,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,724 INFO 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-03-04 16:39:37,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:37,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:37,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:37,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:37,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:39:37,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:37,779 INFO L453 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-03-04 16:39:37,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:38,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:40,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-03-04 16:39:40,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:40,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:39:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:39:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:39:40,745 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-03-04 16:39:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:40,970 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-03-04 16:39:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:39:40,970 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-03-04 16:39:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:40,972 INFO L225 Difference]: With dead ends: 117 [2019-03-04 16:39:40,972 INFO L226 Difference]: Without dead ends: 116 [2019-03-04 16:39:40,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:39:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-03-04 16:39:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-03-04 16:39:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:39:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-03-04 16:39:40,976 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-03-04 16:39:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:40,977 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-03-04 16:39:40,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:39:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-03-04 16:39:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:39:40,978 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:40,978 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-03-04 16:39:40,978 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-03-04 16:39:40,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:41,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:41,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:41,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,811 INFO 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-03-04 16:39:41,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:41,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:39:41,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:41,892 INFO L453 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-03-04 16:39:41,893 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,913 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,913 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:44,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-03-04 16:39:44,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:44,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:39:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:39:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:39:44,993 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-03-04 16:39:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:45,333 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-03-04 16:39:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:39:45,333 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-03-04 16:39:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:45,334 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:39:45,334 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:39:45,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:39:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:39:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-03-04 16:39:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-03-04 16:39:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-03-04 16:39:45,339 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-03-04 16:39:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:45,340 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-03-04 16:39:45,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:39:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-03-04 16:39:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-03-04 16:39:45,341 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:45,341 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-03-04 16:39:45,341 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-03-04 16:39:45,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:46,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:46,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:46,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:46,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:46,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:46,181 INFO 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-03-04 16:39:46,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:46,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:46,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-03-04 16:39:46,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:46,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:39:46,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:46,298 INFO L453 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-03-04 16:39:46,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:46,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:46,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:49,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:49,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-03-04 16:39:49,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:49,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:39:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:39:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:39:49,301 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-03-04 16:39:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:49,699 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-03-04 16:39:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:39:49,700 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-03-04 16:39:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:49,701 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:39:49,701 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:39:49,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:39:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:39:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-03-04 16:39:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:39:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:39:49,706 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-03-04 16:39:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:49,707 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:39:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:39:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:39:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:39:49,708 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:49,708 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-03-04 16:39:49,708 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-03-04 16:39:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:49,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:49,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:50,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:50,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:50,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:50,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:50,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:50,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:39:50,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:50,932 INFO L453 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-03-04 16:39:50,933 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:52,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-03-04 16:39:54,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:54,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:39:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:39:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:39:54,575 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-03-04 16:39:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:54,928 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-03-04 16:39:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:39:54,928 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-03-04 16:39:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:54,930 INFO L225 Difference]: With dead ends: 126 [2019-03-04 16:39:54,930 INFO L226 Difference]: Without dead ends: 125 [2019-03-04 16:39:54,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:39:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-03-04 16:39:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-03-04 16:39:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:39:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-03-04 16:39:54,935 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-03-04 16:39:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:54,935 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-03-04 16:39:54,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:39:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-03-04 16:39:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-03-04 16:39:54,936 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:54,936 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-03-04 16:39:54,936 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:54,936 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-03-04 16:39:54,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:54,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:54,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:55,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:55,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:55,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:55,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:55,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:55,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 130 conjunts are in the unsatisfiable core [2019-03-04 16:39:55,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:55,909 INFO L453 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-03-04 16:39:55,909 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,920 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:39:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:56,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:59,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:59,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-03-04 16:39:59,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:59,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:39:59,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:39:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:39:59,052 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-03-04 16:39:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:59,453 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-03-04 16:39:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:39:59,454 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-03-04 16:39:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:59,456 INFO L225 Difference]: With dead ends: 129 [2019-03-04 16:39:59,457 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:39:59,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:39:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:39:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-03-04 16:39:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:39:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-03-04 16:39:59,463 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-03-04 16:39:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:59,463 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-03-04 16:39:59,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:39:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-03-04 16:39:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-03-04 16:39:59,464 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:59,464 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-03-04 16:39:59,464 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-03-04 16:39:59,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:00,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:00,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:00,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:00,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:00,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:00,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-03-04 16:40:00,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:00,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:40:00,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:00,857 INFO L453 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-03-04 16:40:00,858 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,872 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-03-04 16:40:04,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:04,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:40:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:40:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:40:04,248 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-03-04 16:40:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:04,588 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-03-04 16:40:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:40:04,589 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-03-04 16:40:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:04,590 INFO L225 Difference]: With dead ends: 132 [2019-03-04 16:40:04,590 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:40:04,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:40:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:40:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-03-04 16:40:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:40:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-03-04 16:40:04,596 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-03-04 16:40:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:04,597 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-03-04 16:40:04,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:40:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-03-04 16:40:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-03-04 16:40:04,598 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:04,598 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-03-04 16:40:04,598 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-03-04 16:40:04,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:04,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:04,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:04,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:06,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:06,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:06,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:06,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:06,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:06,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:06,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:06,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:06,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:40:06,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:06,162 INFO L453 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-03-04 16:40:06,162 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,170 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:09,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-03-04 16:40:09,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:09,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:40:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:40:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:40:09,546 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-03-04 16:40:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:10,178 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:40:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:40:10,178 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-03-04 16:40:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:10,179 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:40:10,179 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:40:10,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:40:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:40:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-03-04 16:40:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:40:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-03-04 16:40:10,185 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-03-04 16:40:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:10,186 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-03-04 16:40:10,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:40:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-03-04 16:40:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:40:10,187 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:10,187 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-03-04 16:40:10,187 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-03-04 16:40:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:12,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:12,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:12,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:12,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:12,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:12,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:12,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:12,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:40:12,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:12,158 INFO L453 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-03-04 16:40:12,159 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:12,170 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:12,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:13,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-03-04 16:40:15,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:15,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:40:15,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:40:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:40:15,999 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-03-04 16:40:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:16,259 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-03-04 16:40:16,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:40:16,259 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-03-04 16:40:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:16,261 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:40:16,261 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:40:16,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:40:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:40:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-03-04 16:40:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:40:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-03-04 16:40:16,266 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-03-04 16:40:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:16,266 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-03-04 16:40:16,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:40:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-03-04 16:40:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:40:16,267 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:16,267 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-03-04 16:40:16,267 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-03-04 16:40:16,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:16,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:16,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:17,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:17,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:17,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:17,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:17,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:17,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:17,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:17,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:17,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-03-04 16:40:17,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:17,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:40:17,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:17,483 INFO L453 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-03-04 16:40:17,484 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,494 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-03-04 16:40:21,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:21,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:40:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:40:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:40:21,519 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-03-04 16:40:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:21,794 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-03-04 16:40:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:40:21,797 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-03-04 16:40:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:21,798 INFO L225 Difference]: With dead ends: 141 [2019-03-04 16:40:21,798 INFO L226 Difference]: Without dead ends: 140 [2019-03-04 16:40:21,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:40:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-03-04 16:40:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-03-04 16:40:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:40:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-03-04 16:40:21,804 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-03-04 16:40:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:21,805 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-03-04 16:40:21,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:40:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-03-04 16:40:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-03-04 16:40:21,806 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:21,806 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-03-04 16:40:21,806 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-03-04 16:40:21,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:21,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:21,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:22,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:22,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:22,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:22,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,972 INFO 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-03-04 16:40:22,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:22,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:23,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:23,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:23,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:40:23,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:23,057 INFO L453 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-03-04 16:40:23,058 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,124 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:27,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-03-04 16:40:27,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:27,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:40:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:40:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:40:27,161 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-03-04 16:40:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:27,601 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-03-04 16:40:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:40:27,602 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-03-04 16:40:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:27,603 INFO L225 Difference]: With dead ends: 144 [2019-03-04 16:40:27,604 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:40:27,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:40:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:40:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-03-04 16:40:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:40:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-03-04 16:40:27,609 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-03-04 16:40:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:27,610 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-03-04 16:40:27,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:40:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-03-04 16:40:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-03-04 16:40:27,611 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:27,611 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-03-04 16:40:27,611 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-03-04 16:40:27,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:29,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:29,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:29,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,269 INFO 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-03-04 16:40:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:29,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 148 conjunts are in the unsatisfiable core [2019-03-04 16:40:29,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:29,349 INFO L453 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-03-04 16:40:29,350 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,411 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:34,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-03-04 16:40:34,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:34,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:40:34,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:40:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:40:34,017 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-03-04 16:40:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:34,373 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-03-04 16:40:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:40:34,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-03-04 16:40:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:34,375 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:40:34,375 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:40:34,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:40:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:40:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-03-04 16:40:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:40:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-03-04 16:40:34,380 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-03-04 16:40:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:34,380 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-03-04 16:40:34,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:40:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-03-04 16:40:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-03-04 16:40:34,381 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:34,381 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-03-04 16:40:34,381 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:34,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-03-04 16:40:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:36,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:36,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:36,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:36,166 INFO 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-03-04 16:40:36,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:36,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:36,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-03-04 16:40:36,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:36,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:40:36,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:36,352 INFO L453 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-03-04 16:40:36,353 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,455 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,456 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:40,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-03-04 16:40:40,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:40,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:40:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:40:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:40:40,656 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-03-04 16:40:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,080 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-03-04 16:40:41,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:40:41,081 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-03-04 16:40:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,082 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:40:41,082 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:40:41,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:40:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:40:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-03-04 16:40:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:40:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-03-04 16:40:41,089 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-03-04 16:40:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:41,090 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-03-04 16:40:41,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:40:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-03-04 16:40:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-03-04 16:40:41,091 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:41,091 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-03-04 16:40:41,091 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-03-04 16:40:41,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:41,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:41,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:41,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:42,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:42,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:42,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:42,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:42,232 INFO 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-03-04 16:40:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:42,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:42,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:42,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:42,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:40:42,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:42,296 INFO L453 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-03-04 16:40:42,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,307 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:46,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-03-04 16:40:46,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:46,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:40:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:40:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:40:46,924 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-03-04 16:40:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:47,306 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-03-04 16:40:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-03-04 16:40:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:47,308 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:40:47,308 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:40:47,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:40:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:40:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-03-04 16:40:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:40:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-03-04 16:40:47,314 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-03-04 16:40:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:47,315 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-03-04 16:40:47,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:40:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-03-04 16:40:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-03-04 16:40:47,316 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:47,316 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-03-04 16:40:47,316 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-03-04 16:40:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:48,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:48,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:48,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:48,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,818 INFO 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-03-04 16:40:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:48,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:40:48,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:48,921 INFO L453 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-03-04 16:40:48,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:49,019 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:49,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:50,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-03-04 16:40:53,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:53,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:40:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:40:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:40:53,990 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-03-04 16:40:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:54,339 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-03-04 16:40:54,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:40:54,339 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-03-04 16:40:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:54,340 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:40:54,341 INFO L226 Difference]: Without dead ends: 155 [2019-03-04 16:40:54,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:40:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-03-04 16:40:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-03-04 16:40:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-03-04 16:40:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-03-04 16:40:54,347 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-03-04 16:40:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:54,347 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-03-04 16:40:54,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:40:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-03-04 16:40:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-03-04 16:40:54,348 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:54,349 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-03-04 16:40:54,349 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-03-04 16:40:54,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:54,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:54,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:55,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:55,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:55,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:55,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:55,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:55,629 INFO 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-03-04 16:40:55,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:55,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:55,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-03-04 16:40:55,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:55,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:40:55,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:55,814 INFO L453 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-03-04 16:40:55,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,825 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:40:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:57,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:00,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-03-04 16:41:00,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:00,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:41:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:41:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:41:00,643 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-03-04 16:41:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:00,959 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-03-04 16:41:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:41:00,959 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-03-04 16:41:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:00,961 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:41:00,961 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:41:00,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:41:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:41:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-03-04 16:41:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:41:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-03-04 16:41:00,967 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-03-04 16:41:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:00,967 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-03-04 16:41:00,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:41:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-03-04 16:41:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:41:00,968 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:00,968 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-03-04 16:41:00,969 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-03-04 16:41:00,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:00,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:00,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:00,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:02,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:02,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:02,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:02,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:02,798 INFO 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-03-04 16:41:02,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:02,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:02,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:02,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:02,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:41:02,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:02,913 INFO L453 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-03-04 16:41:02,914 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,011 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,011 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:05,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:09,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:09,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-03-04 16:41:09,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:09,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:41:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:41:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:41:09,356 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-03-04 16:41:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:09,805 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-03-04 16:41:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:41:09,805 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-03-04 16:41:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:09,807 INFO L225 Difference]: With dead ends: 162 [2019-03-04 16:41:09,807 INFO L226 Difference]: Without dead ends: 161 [2019-03-04 16:41:09,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:41:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-03-04 16:41:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-03-04 16:41:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-03-04 16:41:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-03-04 16:41:09,813 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-03-04 16:41:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:09,813 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-03-04 16:41:09,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:41:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-03-04 16:41:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-03-04 16:41:09,814 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:09,814 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-03-04 16:41:09,814 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-03-04 16:41:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:09,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:09,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:11,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:11,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:11,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:11,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,139 INFO 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-03-04 16:41:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:11,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 166 conjunts are in the unsatisfiable core [2019-03-04 16:41:11,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:11,208 INFO L453 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-03-04 16:41:11,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,218 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:11,218 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:13,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:16,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-03-04 16:41:16,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:16,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:41:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:41:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:41:16,337 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-03-04 16:41:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:16,843 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-03-04 16:41:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:41:16,843 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-03-04 16:41:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:16,844 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:41:16,844 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:41:16,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:41:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:41:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-03-04 16:41:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-03-04 16:41:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-03-04 16:41:16,848 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-03-04 16:41:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:16,848 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-03-04 16:41:16,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:41:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-03-04 16:41:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-03-04 16:41:16,849 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:16,849 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-03-04 16:41:16,849 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-03-04 16:41:16,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:16,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:16,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:18,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:18,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:18,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:18,215 INFO 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-03-04 16:41:18,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:18,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:18,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-03-04 16:41:18,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:18,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:41:18,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:18,405 INFO L453 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-03-04 16:41:18,405 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,417 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,417 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:20,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:24,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:24,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-03-04 16:41:24,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:24,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:41:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:41:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:41:24,361 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-03-04 16:41:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:24,765 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-03-04 16:41:24,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:41:24,765 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-03-04 16:41:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:24,770 INFO L225 Difference]: With dead ends: 168 [2019-03-04 16:41:24,770 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:41:24,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:41:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:41:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-03-04 16:41:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-03-04 16:41:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-03-04 16:41:24,776 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-03-04 16:41:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:24,776 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-03-04 16:41:24,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:41:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-03-04 16:41:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-03-04 16:41:24,777 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:24,778 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-03-04 16:41:24,778 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-03-04 16:41:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:24,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:24,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:24,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:26,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:26,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:26,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:26,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:26,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:26,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:26,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:26,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:26,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:26,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:26,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:41:26,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:26,368 INFO L453 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-03-04 16:41:26,369 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,474 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:28,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:31,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:31,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-03-04 16:41:31,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:31,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:41:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:41:31,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:41:31,779 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-03-04 16:41:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:32,228 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-03-04 16:41:32,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:41:32,228 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-03-04 16:41:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:32,229 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:41:32,229 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:41:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:41:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:41:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-03-04 16:41:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-03-04 16:41:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-03-04 16:41:32,234 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-03-04 16:41:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-03-04 16:41:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:41:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-03-04 16:41:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-03-04 16:41:32,235 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:32,235 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-03-04 16:41:32,235 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:32,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-03-04 16:41:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:33,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:33,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,697 INFO 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-03-04 16:41:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:33,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:41:33,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:33,767 INFO L453 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-03-04 16:41:33,767 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:35,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:39,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-03-04 16:41:39,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:39,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:41:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:41:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:41:39,163 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-03-04 16:41:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:39,546 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-03-04 16:41:39,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:41:39,546 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-03-04 16:41:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:39,547 INFO L225 Difference]: With dead ends: 174 [2019-03-04 16:41:39,547 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:41:39,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:41:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:41:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-03-04 16:41:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-03-04 16:41:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-03-04 16:41:39,551 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-03-04 16:41:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:39,551 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-03-04 16:41:39,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:41:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-03-04 16:41:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-03-04 16:41:39,552 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:39,552 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-03-04 16:41:39,552 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-03-04 16:41:39,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:41,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:41,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,120 INFO 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-03-04 16:41:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:41,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:41,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-03-04 16:41:41,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:41,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:41:41,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:41,331 INFO L453 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-03-04 16:41:41,331 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,342 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:47,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-03-04 16:41:47,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:47,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:41:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:41:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:41:47,019 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-03-04 16:41:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:47,508 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-03-04 16:41:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:41:47,508 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-03-04 16:41:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:47,509 INFO L225 Difference]: With dead ends: 177 [2019-03-04 16:41:47,509 INFO L226 Difference]: Without dead ends: 176 [2019-03-04 16:41:47,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:41:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-03-04 16:41:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-03-04 16:41:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:41:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-03-04 16:41:47,514 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-03-04 16:41:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:47,515 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-03-04 16:41:47,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:41:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-03-04 16:41:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:41:47,515 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:47,515 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-03-04 16:41:47,516 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-03-04 16:41:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:47,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:47,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:49,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:49,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:49,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:49,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,099 INFO 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-03-04 16:41:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:49,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:49,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:49,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:49,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:41:49,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:49,176 INFO L453 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-03-04 16:41:49,176 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,185 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:51,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:54,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-03-04 16:41:54,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:54,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:41:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:41:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:41:54,888 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-03-04 16:41:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:55,318 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-03-04 16:41:55,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:41:55,319 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-03-04 16:41:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:55,320 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:41:55,320 INFO L226 Difference]: Without dead ends: 179 [2019-03-04 16:41:55,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:41:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-03-04 16:41:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-03-04 16:41:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:41:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-03-04 16:41:55,324 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-03-04 16:41:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:55,325 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-03-04 16:41:55,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:41:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-03-04 16:41:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:41:55,325 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:55,326 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-03-04 16:41:55,326 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-03-04 16:41:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:55,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:55,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:56,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:56,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:56,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:56,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:56,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:56,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:56,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:57,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 184 conjunts are in the unsatisfiable core [2019-03-04 16:41:57,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:57,039 INFO L453 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-03-04 16:41:57,039 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:57,051 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:57,051 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:41:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:59,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:02,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:02,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-03-04 16:42:02,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:02,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:42:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:42:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:42:02,932 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-03-04 16:42:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:03,357 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-03-04 16:42:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:42:03,357 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-03-04 16:42:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:03,358 INFO L225 Difference]: With dead ends: 183 [2019-03-04 16:42:03,358 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:42:03,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:42:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:42:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-03-04 16:42:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:42:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:42:03,365 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-03-04 16:42:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:03,366 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:42:03,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:42:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:42:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:42:03,367 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:03,367 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-03-04 16:42:03,367 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-03-04 16:42:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:05,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:05,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:05,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:05,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 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-03-04 16:42:05,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:05,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:05,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-03-04 16:42:05,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:05,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:42:05,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:05,690 INFO L453 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-03-04 16:42:05,691 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:05,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:05,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:07,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:11,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:11,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-03-04 16:42:11,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:11,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:42:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:42:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:42:11,436 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-03-04 16:42:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:11,835 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-03-04 16:42:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:42:11,835 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-03-04 16:42:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:11,836 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:42:11,836 INFO L226 Difference]: Without dead ends: 185 [2019-03-04 16:42:11,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:42:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-03-04 16:42:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-03-04 16:42:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-03-04 16:42:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-03-04 16:42:11,842 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-03-04 16:42:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:11,842 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-03-04 16:42:11,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:42:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-03-04 16:42:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-03-04 16:42:11,844 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:11,844 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-03-04 16:42:11,844 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-03-04 16:42:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:11,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:11,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:13,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:13,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:13,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:13,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:13,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:13,705 INFO 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-03-04 16:42:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:13,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:13,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:13,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:13,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:42:13,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:13,806 INFO L453 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-03-04 16:42:13,806 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:15,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:19,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-03-04 16:42:19,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:19,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:42:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:42:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:42:19,730 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-03-04 16:42:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:20,182 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-03-04 16:42:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:42:20,183 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-03-04 16:42:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:20,184 INFO L225 Difference]: With dead ends: 189 [2019-03-04 16:42:20,184 INFO L226 Difference]: Without dead ends: 188 [2019-03-04 16:42:20,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:42:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-03-04 16:42:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-03-04 16:42:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-03-04 16:42:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-03-04 16:42:20,188 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-03-04 16:42:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:20,188 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-03-04 16:42:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:42:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-03-04 16:42:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-03-04 16:42:20,189 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:20,189 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-03-04 16:42:20,189 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-03-04 16:42:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:20,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:20,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:21,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:21,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:21,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:21,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:21,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:21,932 INFO 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-03-04 16:42:21,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:21,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:21,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:42:22,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:22,005 INFO L453 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-03-04 16:42:22,005 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:22,015 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:24,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:27,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:27,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-03-04 16:42:27,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:27,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:42:27,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:42:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:42:27,882 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-03-04 16:42:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:28,443 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-03-04 16:42:28,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:42:28,444 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-03-04 16:42:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:28,445 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:42:28,446 INFO L226 Difference]: Without dead ends: 191 [2019-03-04 16:42:28,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:42:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-03-04 16:42:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-03-04 16:42:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-03-04 16:42:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-03-04 16:42:28,452 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-03-04 16:42:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:28,452 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-03-04 16:42:28,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:42:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-03-04 16:42:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-03-04 16:42:28,452 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:28,453 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-03-04 16:42:28,453 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-03-04 16:42:28,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:28,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:28,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:30,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:30,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:30,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:30,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:30,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:30,351 INFO 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-03-04 16:42:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:30,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:30,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-03-04 16:42:30,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:30,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:42:30,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:30,611 INFO L453 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-03-04 16:42:30,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:32,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-03-04 16:42:36,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:36,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:42:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:42:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:42:36,708 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-03-04 16:42:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:37,210 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:42:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:42:37,211 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-03-04 16:42:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:37,212 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:42:37,213 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:42:37,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:42:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:42:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-03-04 16:42:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:42:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-03-04 16:42:37,218 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-03-04 16:42:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:37,218 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-03-04 16:42:37,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:42:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-03-04 16:42:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-03-04 16:42:37,219 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:37,219 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-03-04 16:42:37,219 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-03-04 16:42:37,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:37,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:37,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:39,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:39,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:39,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:39,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:39,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:39,329 INFO 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-03-04 16:42:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:39,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:39,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:39,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:39,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:42:39,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:39,410 INFO L453 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-03-04 16:42:39,410 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:39,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:39,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:41,792 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:45,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:45,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-03-04 16:42:45,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:45,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:42:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:42:45,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:42:45,525 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-03-04 16:42:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:46,071 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-03-04 16:42:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:42:46,071 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-03-04 16:42:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:46,073 INFO L225 Difference]: With dead ends: 198 [2019-03-04 16:42:46,073 INFO L226 Difference]: Without dead ends: 197 [2019-03-04 16:42:46,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:42:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-03-04 16:42:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-03-04 16:42:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:42:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-03-04 16:42:46,080 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-03-04 16:42:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:46,080 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-03-04 16:42:46,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:42:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-03-04 16:42:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:42:46,081 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:46,082 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-03-04 16:42:46,082 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-03-04 16:42:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:46,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:46,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:48,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:48,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:48,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:48,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:48,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:48,059 INFO 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-03-04 16:42:48,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:48,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:48,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 202 conjunts are in the unsatisfiable core [2019-03-04 16:42:48,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:48,142 INFO L453 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-03-04 16:42:48,143 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,153 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:50,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:54,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:54,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-03-04 16:42:54,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:54,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:42:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:42:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:42:54,273 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-03-04 16:42:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:54,730 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-03-04 16:42:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:42:54,730 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-03-04 16:42:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:54,732 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:42:54,732 INFO L226 Difference]: Without dead ends: 200 [2019-03-04 16:42:54,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:42:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-03-04 16:42:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-03-04 16:42:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:42:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-03-04 16:42:54,738 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-03-04 16:42:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-03-04 16:42:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:42:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-03-04 16:42:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:42:54,740 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:54,740 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-03-04 16:42:54,740 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:54,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-03-04 16:42:54,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:54,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:54,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:56,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:56,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:56,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:56,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:56,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:56,720 INFO 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-03-04 16:42:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:56,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:56,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-03-04 16:42:56,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:56,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:42:56,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:56,999 INFO L453 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-03-04 16:42:56,999 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,012 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:42:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:59,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:03,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-03-04 16:43:03,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:03,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:43:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:43:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:43:03,186 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-03-04 16:43:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:03,664 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-03-04 16:43:03,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:43:03,664 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-03-04 16:43:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:03,665 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:43:03,665 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:43:03,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:43:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:43:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-03-04 16:43:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:43:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-03-04 16:43:03,671 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-03-04 16:43:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:03,671 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-03-04 16:43:03,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:43:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-03-04 16:43:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-03-04 16:43:03,672 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:03,672 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-03-04 16:43:03,672 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-03-04 16:43:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:03,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:03,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:03,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:05,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:05,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:05,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:05,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:05,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:05,981 INFO 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-03-04 16:43:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:43:05,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:43:06,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:43:06,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:06,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:43:06,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:06,066 INFO L453 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-03-04 16:43:06,066 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,077 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:06,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:08,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-03-04 16:43:12,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:12,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:43:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:43:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:43:12,365 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-03-04 16:43:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:12,882 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-03-04 16:43:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:43:12,883 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-03-04 16:43:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:12,884 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:43:12,884 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:43:12,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:43:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:43:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-03-04 16:43:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-03-04 16:43:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-03-04 16:43:12,892 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-03-04 16:43:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:12,892 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-03-04 16:43:12,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:43:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-03-04 16:43:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-03-04 16:43:12,893 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:12,894 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-03-04 16:43:12,894 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-03-04 16:43:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:12,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:12,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:15,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:15,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:15,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:43:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:15,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:15,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:43:15,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:15,103 INFO L453 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-03-04 16:43:15,103 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,112 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:15,112 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:17,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:21,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:21,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-03-04 16:43:21,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:21,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:43:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:43:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:43:21,621 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-03-04 16:43:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:22,061 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-03-04 16:43:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:43:22,062 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-03-04 16:43:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:22,063 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:43:22,063 INFO L226 Difference]: Without dead ends: 209 [2019-03-04 16:43:22,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:43:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-03-04 16:43:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-03-04 16:43:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-03-04 16:43:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-03-04 16:43:22,069 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-03-04 16:43:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:22,069 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-03-04 16:43:22,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:43:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-03-04 16:43:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-03-04 16:43:22,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:22,070 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-03-04 16:43:22,070 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-03-04 16:43:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:22,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:24,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:24,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:24,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:24,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:24,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:24,253 INFO 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-03-04 16:43:24,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:24,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:24,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-03-04 16:43:24,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:24,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:43:24,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:24,558 INFO L453 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-03-04 16:43:24,558 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,567 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,567 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:27,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-03-04 16:43:30,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:30,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:43:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:43:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:43:30,944 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-03-04 16:43:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:31,493 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-03-04 16:43:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:43:31,493 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-03-04 16:43:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:31,495 INFO L225 Difference]: With dead ends: 213 [2019-03-04 16:43:31,495 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:43:31,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:43:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:43:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-03-04 16:43:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-03-04 16:43:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-03-04 16:43:31,502 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-03-04 16:43:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:31,502 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-03-04 16:43:31,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:43:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-03-04 16:43:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-03-04 16:43:31,503 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:31,503 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-03-04 16:43:31,503 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-03-04 16:43:31,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:31,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:31,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:33,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:33,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:33,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:33,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:33,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:33,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:43:33,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:43:33,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:43:33,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:43:33,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:33,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 16:43:33,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:33,913 INFO L453 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-03-04 16:43:33,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:33,919 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:33,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:36,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:40,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:40,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-03-04 16:43:40,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:40,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:43:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:43:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:43:40,553 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-03-04 16:43:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:41,034 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-03-04 16:43:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:43:41,034 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-03-04 16:43:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:41,036 INFO L225 Difference]: With dead ends: 216 [2019-03-04 16:43:41,036 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:43:41,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:43:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:43:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-03-04 16:43:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:43:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-03-04 16:43:41,043 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-03-04 16:43:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:41,043 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-03-04 16:43:41,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:43:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-03-04 16:43:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-03-04 16:43:41,044 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:41,044 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-03-04 16:43:41,045 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-03-04 16:43:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:41,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:41,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:41,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:43,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:43,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:43,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:43,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:43,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:43,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:43:43,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:43,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:43,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 220 conjunts are in the unsatisfiable core [2019-03-04 16:43:43,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:43,388 INFO L453 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-03-04 16:43:43,388 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:43,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:43,399 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:46,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:50,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:50,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-03-04 16:43:50,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:50,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:43:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:43:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:43:50,206 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-03-04 16:43:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:50,666 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-03-04 16:43:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:43:50,666 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-03-04 16:43:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:50,668 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:43:50,668 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:43:50,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:43:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:43:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-03-04 16:43:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:43:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-03-04 16:43:50,674 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-03-04 16:43:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:50,674 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-03-04 16:43:50,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:43:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-03-04 16:43:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:43:50,675 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:50,675 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-03-04 16:43:50,676 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-03-04 16:43:50,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:50,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:53,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:53,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:53,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:53,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:53,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:53,061 INFO 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-03-04 16:43:53,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:53,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:53,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-03-04 16:43:53,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:53,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:43:53,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:53,397 INFO L453 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-03-04 16:43:53,397 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:53,405 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:53,406 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:43:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:56,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:00,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:00,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-03-04 16:44:00,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:00,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:44:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:44:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:44:00,179 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-03-04 16:44:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:00,706 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-03-04 16:44:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:44:00,706 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-03-04 16:44:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:00,708 INFO L225 Difference]: With dead ends: 222 [2019-03-04 16:44:00,708 INFO L226 Difference]: Without dead ends: 221 [2019-03-04 16:44:00,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:44:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-03-04 16:44:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-03-04 16:44:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:44:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-03-04 16:44:00,714 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-03-04 16:44:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:00,714 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-03-04 16:44:00,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:44:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-03-04 16:44:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:44:00,715 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:00,715 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-03-04 16:44:00,715 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-03-04 16:44:00,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:00,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:00,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:03,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:03,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:03,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:03,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:03,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:03,114 INFO 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-03-04 16:44:03,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:44:03,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:44:03,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:44:03,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:03,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:44:03,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:03,209 INFO L453 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-03-04 16:44:03,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:03,218 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:03,218 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:06,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:10,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:10,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-03-04 16:44:10,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:10,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:44:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:44:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:44:10,118 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-03-04 16:44:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:10,636 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-03-04 16:44:10,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:44:10,636 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-03-04 16:44:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:10,638 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:44:10,638 INFO L226 Difference]: Without dead ends: 224 [2019-03-04 16:44:10,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:44:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-03-04 16:44:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-03-04 16:44:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-03-04 16:44:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-03-04 16:44:10,643 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-03-04 16:44:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:10,643 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-03-04 16:44:10,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:44:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-03-04 16:44:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-03-04 16:44:10,644 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:10,644 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-03-04 16:44:10,645 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-03-04 16:44:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:10,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:10,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:13,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:13,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:13,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:13,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:13,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:13,129 INFO 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-03-04 16:44:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:13,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:13,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:44:13,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:13,215 INFO L453 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-03-04 16:44:13,215 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:13,223 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:13,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:16,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:20,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-03-04 16:44:20,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:20,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:44:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:44:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:44:20,143 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-03-04 16:44:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:20,680 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-03-04 16:44:20,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:44:20,680 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-03-04 16:44:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:20,681 INFO L225 Difference]: With dead ends: 228 [2019-03-04 16:44:20,682 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:44:20,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:44:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:44:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-03-04 16:44:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:44:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-03-04 16:44:20,688 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-03-04 16:44:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:20,689 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-03-04 16:44:20,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:44:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-03-04 16:44:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-03-04 16:44:20,690 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:20,690 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-03-04 16:44:20,690 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-03-04 16:44:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:20,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:20,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:23,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:23,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:23,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:23,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:23,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:23,306 INFO 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-03-04 16:44:23,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:44:23,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:44:23,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-03-04 16:44:23,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:23,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:44:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:23,639 INFO L453 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-03-04 16:44:23,639 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:23,647 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:23,648 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:26,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:30,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:30,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-03-04 16:44:30,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:30,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:44:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:44:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:44:30,699 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-03-04 16:44:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:31,324 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-03-04 16:44:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:44:31,325 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-03-04 16:44:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:31,326 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:44:31,326 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:44:31,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:44:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:44:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-03-04 16:44:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:44:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-03-04 16:44:31,333 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-03-04 16:44:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:31,333 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-03-04 16:44:31,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:44:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-03-04 16:44:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-03-04 16:44:31,334 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:31,335 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-03-04 16:44:31,335 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-03-04 16:44:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:31,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:31,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:33,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:33,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:33,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:33,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:33,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:33,919 INFO 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-03-04 16:44:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:44:33,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:44:34,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:44:34,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:34,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 16:44:34,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:34,013 INFO L453 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-03-04 16:44:34,013 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:34,021 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:34,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:37,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:41,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:41,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-03-04 16:44:41,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:41,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:44:41,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:44:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:44:41,059 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-03-04 16:44:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:41,709 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-03-04 16:44:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:44:41,709 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-03-04 16:44:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:41,710 INFO L225 Difference]: With dead ends: 234 [2019-03-04 16:44:41,710 INFO L226 Difference]: Without dead ends: 233 [2019-03-04 16:44:41,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:44:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-03-04 16:44:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-03-04 16:44:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-03-04 16:44:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-03-04 16:44:41,716 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-03-04 16:44:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:41,717 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-03-04 16:44:41,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:44:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-03-04 16:44:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-03-04 16:44:41,718 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:41,718 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-03-04 16:44:41,718 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-03-04 16:44:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:41,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:44:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:41,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:44,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:44,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:44,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:44,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:44,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:44,499 INFO 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-03-04 16:44:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:44,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:44:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:44,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 238 conjunts are in the unsatisfiable core [2019-03-04 16:44:44,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:44,585 INFO L453 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-03-04 16:44:44,585 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:44,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:44,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:47,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:44:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:51,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:44:51,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-03-04 16:44:51,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:44:51,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:44:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:44:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:44:51,785 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-03-04 16:44:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:44:52,338 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-03-04 16:44:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:44:52,339 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-03-04 16:44:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:44:52,340 INFO L225 Difference]: With dead ends: 237 [2019-03-04 16:44:52,340 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 16:44:52,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:44:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 16:44:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-03-04 16:44:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-03-04 16:44:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-03-04 16:44:52,346 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-03-04 16:44:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:44:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-03-04 16:44:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:44:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-03-04 16:44:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-03-04 16:44:52,347 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:44:52,347 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-03-04 16:44:52,347 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:44:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:44:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-03-04 16:44:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:44:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:52,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:44:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:44:52,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:44:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:44:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:55,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:55,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:44:55,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:44:55,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:44:55,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:44:55,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 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-03-04 16:44:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:44:55,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:44:55,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-03-04 16:44:55,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:44:55,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 16:44:55,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:44:55,531 INFO L453 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-03-04 16:44:55,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:44:55,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:44:55,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:44:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:44:58,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:02,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:02,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-03-04 16:45:02,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:02,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 16:45:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 16:45:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:45:02,804 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-03-04 16:45:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:03,452 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-03-04 16:45:03,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:45:03,452 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-03-04 16:45:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:03,454 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:45:03,454 INFO L226 Difference]: Without dead ends: 239 [2019-03-04 16:45:03,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:45:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-03-04 16:45:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-03-04 16:45:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-03-04 16:45:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-03-04 16:45:03,459 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-03-04 16:45:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:03,460 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-03-04 16:45:03,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 16:45:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-03-04 16:45:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-03-04 16:45:03,460 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:03,461 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-03-04 16:45:03,461 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-03-04 16:45:03,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:03,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:03,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:06,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:06,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:06,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:45:06,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:06,304 INFO 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-03-04 16:45:06,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:45:06,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:45:06,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:45:06,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:06,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 16:45:06,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:06,399 INFO L453 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-03-04 16:45:06,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:06,412 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:06,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:45:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:09,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:13,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-03-04 16:45:13,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:13,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 16:45:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 16:45:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 16:45:13,797 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-03-04 16:45:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:14,397 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-03-04 16:45:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 16:45:14,397 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-03-04 16:45:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:14,399 INFO L225 Difference]: With dead ends: 243 [2019-03-04 16:45:14,399 INFO L226 Difference]: Without dead ends: 242 [2019-03-04 16:45:14,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 16:45:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-03-04 16:45:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-03-04 16:45:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:45:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:45:14,406 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-03-04 16:45:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:14,406 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:45:14,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 16:45:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:45:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:45:14,407 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:14,407 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-03-04 16:45:14,408 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-03-04 16:45:14,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:14,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:14,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:17,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:17,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:17,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:45:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:17,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:45:17,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:17,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:17,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 16:45:17,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:17,424 INFO L453 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-03-04 16:45:17,424 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:17,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:17,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:45:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:20,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:24,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-03-04 16:45:24,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 16:45:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 16:45:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:45:24,925 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-03-04 16:45:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:25,505 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-03-04 16:45:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 16:45:25,506 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-03-04 16:45:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:25,507 INFO L225 Difference]: With dead ends: 246 [2019-03-04 16:45:25,507 INFO L226 Difference]: Without dead ends: 245 [2019-03-04 16:45:25,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 16:45:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-03-04 16:45:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-03-04 16:45:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-03-04 16:45:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-03-04 16:45:25,512 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-03-04 16:45:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:25,512 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-03-04 16:45:25,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 16:45:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-03-04 16:45:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-03-04 16:45:25,513 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:25,513 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-03-04 16:45:25,513 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-03-04 16:45:25,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:25,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:25,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:28,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:28,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:28,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:28,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:45:28,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:28,568 INFO 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-03-04 16:45:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:45:28,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:45:28,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-03-04 16:45:28,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:28,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 16:45:28,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:28,985 INFO L453 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-03-04 16:45:28,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:28,994 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:28,994 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:45:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:32,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-03-04 16:45:36,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 16:45:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 16:45:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 16:45:36,562 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-03-04 16:45:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:37,130 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-03-04 16:45:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:45:37,131 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-03-04 16:45:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:37,132 INFO L225 Difference]: With dead ends: 249 [2019-03-04 16:45:37,132 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:45:37,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 16:45:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:45:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-03-04 16:45:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-03-04 16:45:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-03-04 16:45:37,138 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-03-04 16:45:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:37,138 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-03-04 16:45:37,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 16:45:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-03-04 16:45:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-03-04 16:45:37,139 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:37,139 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-03-04 16:45:37,139 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-03-04 16:45:37,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:37,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:37,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:40,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:40,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:40,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:40,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:45:40,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:40,090 INFO 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-03-04 16:45:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:45:40,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:45:40,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:45:40,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:45:40,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 16:45:40,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:40,190 INFO L453 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-03-04 16:45:40,190 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:40,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:40,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:45:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:43,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:47,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:47,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-03-04 16:45:47,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:47,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 16:45:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 16:45:47,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:45:47,929 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-03-04 16:45:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:45:48,530 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-03-04 16:45:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 16:45:48,531 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-03-04 16:45:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:45:48,532 INFO L225 Difference]: With dead ends: 252 [2019-03-04 16:45:48,532 INFO L226 Difference]: Without dead ends: 251 [2019-03-04 16:45:48,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 16:45:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-03-04 16:45:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-03-04 16:45:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-03-04 16:45:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-03-04 16:45:48,537 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-03-04 16:45:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:45:48,537 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-03-04 16:45:48,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 16:45:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-03-04 16:45:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-03-04 16:45:48,538 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:45:48,538 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-03-04 16:45:48,538 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:45:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:45:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-03-04 16:45:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:45:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:48,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:45:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:45:48,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:45:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:51,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:51,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:45:51,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:45:51,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:45:51,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:45:51,637 INFO 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-03-04 16:45:51,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:45:51,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:45:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:45:51,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 256 conjunts are in the unsatisfiable core [2019-03-04 16:45:51,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:45:51,730 INFO L453 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-03-04 16:45:51,730 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:45:51,739 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:45:51,739 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:45:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:55,484 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:45:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:45:59,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:45:59,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-03-04 16:45:59,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:45:59,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 16:45:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 16:45:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 16:45:59,500 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-03-04 16:46:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:00,108 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 16:46:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 16:46:00,109 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-03-04 16:46:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:00,110 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:46:00,110 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:46:00,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 16:46:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:46:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-03-04 16:46:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 16:46:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-03-04 16:46:00,116 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-03-04 16:46:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:00,116 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-03-04 16:46:00,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 16:46:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-03-04 16:46:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-03-04 16:46:00,117 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:00,118 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-03-04 16:46:00,118 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-03-04 16:46:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:00,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:03,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:03,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:03,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:03,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:46:03,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:03,278 INFO 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-03-04 16:46:03,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:46:03,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:46:03,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-03-04 16:46:03,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:46:03,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 16:46:03,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:03,744 INFO L453 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-03-04 16:46:03,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:03,755 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:03,755 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:46:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:07,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:11,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:11,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-03-04 16:46:11,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:11,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 16:46:11,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 16:46:11,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:46:11,676 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-03-04 16:46:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:12,281 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-03-04 16:46:12,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:46:12,281 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-03-04 16:46:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:12,283 INFO L225 Difference]: With dead ends: 258 [2019-03-04 16:46:12,283 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 16:46:12,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 16:46:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 16:46:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-03-04 16:46:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-03-04 16:46:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-03-04 16:46:12,288 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-03-04 16:46:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:12,289 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-03-04 16:46:12,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 16:46:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-03-04 16:46:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-03-04 16:46:12,290 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:12,290 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-03-04 16:46:12,290 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-03-04 16:46:12,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:12,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:46:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:12,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:15,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:15,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:15,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:15,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:46:15,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:15,565 INFO 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-03-04 16:46:15,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:46:15,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:46:15,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:46:15,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:46:15,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 16:46:15,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:15,672 INFO L453 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-03-04 16:46:15,672 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:15,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:15,682 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:46:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:19,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:23,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-03-04 16:46:23,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:23,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 16:46:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 16:46:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 16:46:23,696 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-03-04 16:46:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:24,403 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-03-04 16:46:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 16:46:24,403 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-03-04 16:46:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:24,405 INFO L225 Difference]: With dead ends: 261 [2019-03-04 16:46:24,405 INFO L226 Difference]: Without dead ends: 260 [2019-03-04 16:46:24,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 16:46:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-03-04 16:46:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-03-04 16:46:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 16:46:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-03-04 16:46:24,411 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-03-04 16:46:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:24,412 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-03-04 16:46:24,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 16:46:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-03-04 16:46:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 16:46:24,413 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:24,413 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-03-04 16:46:24,413 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-03-04 16:46:24,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:24,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:46:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:24,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:27,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:27,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:27,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:27,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:46:27,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:27,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:46:27,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:27,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:46:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:27,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 16:46:27,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:27,773 INFO L453 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-03-04 16:46:27,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:27,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:27,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:46:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:31,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:35,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:35,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-03-04 16:46:35,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:35,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 16:46:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 16:46:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:46:35,910 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-03-04 16:46:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:36,625 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-03-04 16:46:36,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 16:46:36,625 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-03-04 16:46:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:36,626 INFO L225 Difference]: With dead ends: 264 [2019-03-04 16:46:36,627 INFO L226 Difference]: Without dead ends: 263 [2019-03-04 16:46:36,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 16:46:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-03-04 16:46:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-03-04 16:46:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 16:46:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-03-04 16:46:36,634 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-03-04 16:46:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:36,635 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-03-04 16:46:36,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 16:46:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-03-04 16:46:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 16:46:36,636 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:36,636 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-03-04 16:46:36,636 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-03-04 16:46:36,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:36,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:36,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:46:36,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:36,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:39,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:39,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:39,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:39,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:46:39,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:39,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:46:40,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:46:40,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:46:40,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-03-04 16:46:40,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:46:40,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 16:46:40,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:40,491 INFO L453 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-03-04 16:46:40,492 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:40,504 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:40,504 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:46:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:44,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:46:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:48,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:46:48,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-03-04 16:46:48,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:46:48,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 16:46:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 16:46:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 16:46:48,741 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-03-04 16:46:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:46:49,466 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-03-04 16:46:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 16:46:49,467 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-03-04 16:46:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:46:49,468 INFO L225 Difference]: With dead ends: 267 [2019-03-04 16:46:49,469 INFO L226 Difference]: Without dead ends: 266 [2019-03-04 16:46:49,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 16:46:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-03-04 16:46:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-03-04 16:46:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-03-04 16:46:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-03-04 16:46:49,475 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-03-04 16:46:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:46:49,475 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-03-04 16:46:49,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 16:46:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-03-04 16:46:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-03-04 16:46:49,476 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:46:49,476 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-03-04 16:46:49,477 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:46:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:46:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-03-04 16:46:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:46:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:49,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:46:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:46:49,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:46:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:46:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:52,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:52,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:46:52,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:46:52,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:46:52,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:46:52,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:46:52,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:46:52,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:46:53,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:46:53,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:46:53,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 16:46:53,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:46:53,055 INFO L453 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-03-04 16:46:53,055 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:46:53,065 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:46:53,065 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:46:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:46:57,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:01,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-03-04 16:47:01,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:01,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 16:47:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 16:47:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:47:01,347 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-03-04 16:47:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:01,985 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-03-04 16:47:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 16:47:01,986 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-03-04 16:47:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:01,987 INFO L225 Difference]: With dead ends: 270 [2019-03-04 16:47:01,987 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 16:47:01,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 16:47:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 16:47:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-03-04 16:47:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-03-04 16:47:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-03-04 16:47:01,993 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-03-04 16:47:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:01,993 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-03-04 16:47:01,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 16:47:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-03-04 16:47:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-03-04 16:47:01,994 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:01,994 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-03-04 16:47:01,994 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-03-04 16:47:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:01,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:47:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:01,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:05,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:05,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:05,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:05,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:47:05,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:05,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:47:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:05,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:05,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 274 conjunts are in the unsatisfiable core [2019-03-04 16:47:05,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:05,622 INFO L453 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-03-04 16:47:05,622 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:05,633 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:05,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:47:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:09,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:14,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:14,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-03-04 16:47:14,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:14,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 16:47:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 16:47:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 16:47:14,113 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-03-04 16:47:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:14,926 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-03-04 16:47:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:47:14,927 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-03-04 16:47:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:14,928 INFO L225 Difference]: With dead ends: 273 [2019-03-04 16:47:14,929 INFO L226 Difference]: Without dead ends: 272 [2019-03-04 16:47:14,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 16:47:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-03-04 16:47:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-03-04 16:47:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 16:47:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-03-04 16:47:14,934 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-03-04 16:47:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:14,934 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-03-04 16:47:14,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 16:47:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-03-04 16:47:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-03-04 16:47:14,935 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:14,936 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-03-04 16:47:14,936 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-03-04 16:47:14,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:14,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:14,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:14,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:18,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:18,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:18,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:18,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:47:18,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:18,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:47:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:47:18,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:47:19,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-03-04 16:47:19,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:47:19,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 16:47:19,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:19,142 INFO L453 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-03-04 16:47:19,142 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:19,153 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:19,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:47:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:23,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:27,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:27,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-03-04 16:47:27,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:27,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 16:47:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 16:47:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:47:27,688 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-03-04 16:47:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:28,431 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-03-04 16:47:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 16:47:28,432 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-03-04 16:47:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:28,433 INFO L225 Difference]: With dead ends: 276 [2019-03-04 16:47:28,433 INFO L226 Difference]: Without dead ends: 275 [2019-03-04 16:47:28,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 16:47:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-03-04 16:47:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-03-04 16:47:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-03-04 16:47:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-03-04 16:47:28,440 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-03-04 16:47:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:28,440 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-03-04 16:47:28,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 16:47:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-03-04 16:47:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-03-04 16:47:28,441 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:28,441 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-03-04 16:47:28,441 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-03-04 16:47:28,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:28,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:47:28,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:28,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:32,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:32,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:32,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:32,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:47:32,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:32,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:47:32,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:47:32,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:47:32,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:47:32,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:47:32,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 16:47:32,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:32,215 INFO L453 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-03-04 16:47:32,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,228 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:32,228 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:47:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:36,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:40,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:40,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-03-04 16:47:40,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:40,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 16:47:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 16:47:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 16:47:40,980 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-03-04 16:47:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:41,718 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-03-04 16:47:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 16:47:41,718 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-03-04 16:47:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:41,720 INFO L225 Difference]: With dead ends: 279 [2019-03-04 16:47:41,720 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:47:41,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 16:47:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:47:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-03-04 16:47:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-03-04 16:47:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-03-04 16:47:41,727 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-03-04 16:47:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:41,727 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-03-04 16:47:41,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 16:47:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-03-04 16:47:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-03-04 16:47:41,728 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:41,728 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-03-04 16:47:41,728 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-03-04 16:47:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:41,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:41,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:47:41,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:41,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:45,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:45,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:45,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:45,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:47:45,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:45,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:47:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:45,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:47:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:45,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 16:47:45,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:45,608 INFO L453 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-03-04 16:47:45,608 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:45,616 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:45,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:47:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:50,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:47:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:47:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-03-04 16:47:54,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:47:54,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 16:47:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 16:47:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:47:54,376 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-03-04 16:47:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:47:55,077 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-03-04 16:47:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 16:47:55,083 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-03-04 16:47:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:47:55,084 INFO L225 Difference]: With dead ends: 282 [2019-03-04 16:47:55,084 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 16:47:55,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 16:47:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 16:47:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-03-04 16:47:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-03-04 16:47:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-03-04 16:47:55,090 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-03-04 16:47:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:47:55,090 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-03-04 16:47:55,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 16:47:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-03-04 16:47:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-03-04 16:47:55,091 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:47:55,091 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-03-04 16:47:55,091 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:47:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:47:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-03-04 16:47:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:47:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:47:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:47:55,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:47:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:47:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:47:59,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:59,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:47:59,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:47:59,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:47:59,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:47:59,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:47:59,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:47:59,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:47:59,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-03-04 16:47:59,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:47:59,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 16:47:59,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:47:59,797 INFO L453 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-03-04 16:47:59,797 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:47:59,806 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:47:59,806 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:48:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:04,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:08,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-03-04 16:48:08,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 16:48:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 16:48:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 16:48:08,660 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-03-04 16:48:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:09,467 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-03-04 16:48:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:48:09,468 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-03-04 16:48:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:09,470 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:48:09,470 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:48:09,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 16:48:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:48:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-03-04 16:48:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 16:48:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-03-04 16:48:09,476 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-03-04 16:48:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:09,477 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-03-04 16:48:09,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 16:48:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-03-04 16:48:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-03-04 16:48:09,478 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:09,478 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-03-04 16:48:09,478 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-03-04 16:48:09,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:09,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:09,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:13,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:13,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:13,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:13,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:48:13,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:13,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:48:13,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:48:13,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:48:13,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:48:13,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:13,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 16:48:13,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:13,503 INFO L453 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-03-04 16:48:13,503 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:13,514 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:13,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:48:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:18,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:22,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:22,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-03-04 16:48:22,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:22,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 16:48:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 16:48:22,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:48:22,444 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-03-04 16:48:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:23,258 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-03-04 16:48:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 16:48:23,258 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-03-04 16:48:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:23,260 INFO L225 Difference]: With dead ends: 288 [2019-03-04 16:48:23,260 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 16:48:23,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:48:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 16:48:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-03-04 16:48:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-03-04 16:48:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-03-04 16:48:23,267 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-03-04 16:48:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-03-04 16:48:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 16:48:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-03-04 16:48:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-03-04 16:48:23,268 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:23,268 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-03-04 16:48:23,269 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-03-04 16:48:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:23,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:23,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:27,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:27,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:27,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:27,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:48:27,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:27,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:48:27,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:27,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:48:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:27,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 292 conjunts are in the unsatisfiable core [2019-03-04 16:48:27,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:27,361 INFO L453 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-03-04 16:48:27,361 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:27,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:27,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:48:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:32,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:36,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:36,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-03-04 16:48:36,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:36,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 16:48:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 16:48:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 16:48:36,386 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-03-04 16:48:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:37,119 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-03-04 16:48:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 16:48:37,119 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-03-04 16:48:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:37,121 INFO L225 Difference]: With dead ends: 291 [2019-03-04 16:48:37,121 INFO L226 Difference]: Without dead ends: 290 [2019-03-04 16:48:37,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 16:48:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-03-04 16:48:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-03-04 16:48:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-03-04 16:48:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-03-04 16:48:37,127 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-03-04 16:48:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:37,127 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-03-04 16:48:37,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 16:48:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-03-04 16:48:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-03-04 16:48:37,128 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:37,129 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-03-04 16:48:37,129 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-03-04 16:48:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:37,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:48:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:37,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:41,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:41,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:41,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:41,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:48:41,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:41,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:48:41,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:48:41,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:48:41,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-03-04 16:48:41,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:41,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 16:48:41,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:41,776 INFO L453 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-03-04 16:48:41,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:41,784 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:41,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:48:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:46,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:48:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:50,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:48:50,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-03-04 16:48:50,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:48:50,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 16:48:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 16:48:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:48:50,976 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-03-04 16:48:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:48:51,777 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-03-04 16:48:51,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 16:48:51,777 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-03-04 16:48:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:48:51,779 INFO L225 Difference]: With dead ends: 294 [2019-03-04 16:48:51,779 INFO L226 Difference]: Without dead ends: 293 [2019-03-04 16:48:51,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 16:48:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-03-04 16:48:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-03-04 16:48:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-03-04 16:48:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-03-04 16:48:51,786 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-03-04 16:48:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:48:51,786 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-03-04 16:48:51,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 16:48:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-03-04 16:48:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-03-04 16:48:51,788 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:48:51,788 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-03-04 16:48:51,788 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:48:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:48:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-03-04 16:48:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:48:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:51,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:48:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:48:51,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:48:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:48:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:48:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:55,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:48:55,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:48:55,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:48:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:48:55,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:48:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:48:55,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:48:56,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:48:56,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:48:56,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 16:48:56,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:48:56,084 INFO L453 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-03-04 16:48:56,084 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:48:56,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:48:56,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:49:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:01,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:05,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:05,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-03-04 16:49:05,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:05,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 16:49:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 16:49:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 16:49:05,351 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-03-04 16:49:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:06,092 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-03-04 16:49:06,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:49:06,092 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-03-04 16:49:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:06,094 INFO L225 Difference]: With dead ends: 297 [2019-03-04 16:49:06,094 INFO L226 Difference]: Without dead ends: 296 [2019-03-04 16:49:06,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 16:49:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-03-04 16:49:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-03-04 16:49:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-03-04 16:49:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-03-04 16:49:06,103 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-03-04 16:49:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:06,103 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-03-04 16:49:06,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 16:49:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-03-04 16:49:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-03-04 16:49:06,104 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:06,105 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-03-04 16:49:06,105 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-03-04 16:49:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:06,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:49:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:06,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:10,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:10,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:10,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:10,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:49:10,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:10,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:49:10,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:10,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:49:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:10,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 16:49:10,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:10,535 INFO L453 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-03-04 16:49:10,535 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:10,545 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:10,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:49:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:15,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:19,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:19,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-03-04 16:49:19,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:19,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 16:49:19,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 16:49:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:49:19,915 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-03-04 16:49:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:20,716 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-03-04 16:49:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 16:49:20,716 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-03-04 16:49:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:20,718 INFO L225 Difference]: With dead ends: 300 [2019-03-04 16:49:20,718 INFO L226 Difference]: Without dead ends: 299 [2019-03-04 16:49:20,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 16:49:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-03-04 16:49:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-03-04 16:49:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-03-04 16:49:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-03-04 16:49:20,725 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-03-04 16:49:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:20,725 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-03-04 16:49:20,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 16:49:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-03-04 16:49:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-03-04 16:49:20,726 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:20,726 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-03-04 16:49:20,727 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-03-04 16:49:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:20,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:20,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:25,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:25,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:25,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:25,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:49:25,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:25,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:49:25,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:49:25,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:49:25,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-03-04 16:49:25,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:49:25,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 16:49:25,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:25,726 INFO L453 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-03-04 16:49:25,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:25,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:25,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:49:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:31,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-03-04 16:49:35,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:35,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 16:49:35,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 16:49:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 16:49:35,170 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-03-04 16:49:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:36,058 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-03-04 16:49:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 16:49:36,058 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-03-04 16:49:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:36,059 INFO L225 Difference]: With dead ends: 303 [2019-03-04 16:49:36,059 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:49:36,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 16:49:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:49:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-03-04 16:49:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 16:49:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 16:49:36,066 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-03-04 16:49:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:36,067 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 16:49:36,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 16:49:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 16:49:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 16:49:36,068 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:36,068 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-03-04 16:49:36,069 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-03-04 16:49:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:36,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:49:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:36,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:40,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:40,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:40,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:40,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:49:40,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:40,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:49:40,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:49:40,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:49:41,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:49:41,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:49:41,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 307 conjunts are in the unsatisfiable core [2019-03-04 16:49:41,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:41,079 INFO L453 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-03-04 16:49:41,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:49:41,101 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:49:41,102 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:49:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:46,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:49:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:49:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-03-04 16:49:50,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:49:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 16:49:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 16:49:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:49:50,710 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-03-04 16:49:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:49:51,534 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 16:49:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:49:51,534 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-03-04 16:49:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:49:51,535 INFO L225 Difference]: With dead ends: 306 [2019-03-04 16:49:51,535 INFO L226 Difference]: Without dead ends: 305 [2019-03-04 16:49:51,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 16:49:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-03-04 16:49:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-03-04 16:49:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 16:49:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-03-04 16:49:51,542 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-03-04 16:49:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:49:51,542 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-03-04 16:49:51,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 16:49:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-03-04 16:49:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-03-04 16:49:51,544 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:49:51,544 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-03-04 16:49:51,544 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:49:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:49:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-03-04 16:49:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:49:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:51,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:49:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:49:51,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:49:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:55,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:55,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:49:55,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:49:55,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:49:55,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:49:55,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:49:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:49:55,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:49:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:49:55,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 102 conjunts are in the unsatisfiable core [2019-03-04 16:49:55,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:49:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:49:56,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:50:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:50:00,214 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:50:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2019-03-04 16:50:00,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:50:00,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-03-04 16:50:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-03-04 16:50:00,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:50:00,216 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-03-04 16:50:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:50:00,960 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 16:50:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:50:00,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-03-04 16:50:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:50:00,962 INFO L225 Difference]: With dead ends: 306 [2019-03-04 16:50:00,962 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:50:00,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:50:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:50:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:50:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:50:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:50:00,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-03-04 16:50:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:50:00,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:50:00,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-03-04 16:50:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:50:00,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:50:00,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:50:01,084 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-03-04 16:50:04,152 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-03-04 16:50:04,160 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:50:04,160 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:50:04,160 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-03-04 16:50:04,160 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-03-04 16:50:04,163 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-03-04 16:50:04,163 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-03-04 16:50:04,163 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-03-04 16:50:04,215 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:50:04 BoogieIcfgContainer [2019-03-04 16:50:04,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:50:04,216 INFO L168 Benchmark]: Toolchain (without parser) took 696811.72 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 104.2 MB in the beginning and 980.9 MB in the end (delta: -876.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-03-04 16:50:04,216 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:50:04,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 101.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:50:04,217 INFO L168 Benchmark]: Boogie Preprocessor took 35.59 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 100.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:50:04,217 INFO L168 Benchmark]: RCFGBuilder took 324.20 ms. Allocated memory is still 137.9 MB. Free memory was 100.6 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:50:04,218 INFO L168 Benchmark]: TraceAbstraction took 696380.36 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 90.4 MB in the beginning and 980.9 MB in the end (delta: -890.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-03-04 16:50:04,220 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 101.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.59 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 100.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 324.20 ms. Allocated memory is still 137.9 MB. Free memory was 100.6 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 696380.36 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 90.4 MB in the beginning and 980.9 MB in the end (delta: -890.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 696.2s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 604.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.9s SatisfiabilityAnalysisTime, 628.9s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...