java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:12,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:12,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:12,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:12,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:12,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:12,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:12,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:12,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:12,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:12,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:12,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:12,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:12,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:12,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:12,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:12,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:12,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:12,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:12,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:12,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:12,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:12,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:12,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:12,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:12,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:12,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:12,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:12,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:12,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:12,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:12,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:12,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:12,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:12,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:12,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:12,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 16:54:12,489 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:12,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:12,490 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:12,491 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:12,491 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:12,491 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:12,492 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:12,492 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:12,492 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:12,492 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:12,492 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:12,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:12,493 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:12,493 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:12,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:12,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:12,495 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:12,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:12,495 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:12,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:12,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:12,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:12,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:12,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:12,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:12,499 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:12,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:12,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:12,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:12,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:12,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:12,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:12,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:12,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:12,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:12,501 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:12,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:12,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:12,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:12,502 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:12,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:12,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:12,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:12,574 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:12,575 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:12,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-01-31 16:54:12,576 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-31 16:54:12,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:12,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:12,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:12,620 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:12,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:12,661 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:12,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... [2019-01-31 16:54:12,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:12,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:12,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:12,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 16:54:12,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 16:54:12,999 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 16:54:12,999 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-31 16:54:13,000 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:13 BoogieIcfgContainer [2019-01-31 16:54:13,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:13,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:13,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:13,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:13,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:12" (1/2) ... [2019-01-31 16:54:13,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414394a1 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:13, skipping insertion in model container [2019-01-31 16:54:13,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:13" (2/2) ... [2019-01-31 16:54:13,008 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-31 16:54:13,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:13,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 16:54:13,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 16:54:13,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:13,065 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:13,066 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:13,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:13,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:13,066 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:13,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:13,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 16:54:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 16:54:13,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 16:54:13,090 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 16:54:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:13,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:13,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:13,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:13,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:13,302 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 16:54:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,397 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-31 16:54:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:13,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 16:54:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,410 INFO L225 Difference]: With dead ends: 10 [2019-01-31 16:54:13,411 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 16:54:13,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 16:54:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 16:54:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 16:54:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-31 16:54:13,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-31 16:54:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,451 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-31 16:54:13,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 16:54:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 16:54:13,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 16:54:13,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-31 16:54:13,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:13,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:13,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:13,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 16:54:13,572 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-31 16:54:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,645 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-31 16:54:13,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:13,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 16:54:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,647 INFO L225 Difference]: With dead ends: 11 [2019-01-31 16:54:13,647 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 16:54:13,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 16:54:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 16:54:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 16:54:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 16:54:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 16:54:13,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-31 16:54:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,652 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 16:54:13,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 16:54:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 16:54:13,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 16:54:13,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-31 16:54:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:13,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:13,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 16:54:13,951 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-31 16:54:13,986 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:13,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:14,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:14,153 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 16:54:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:14,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:14,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:14,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:14,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:14,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:14,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,875 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-31 16:54:14,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:14,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:14,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:14,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 16:54:15,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:15,033 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-31 16:54:15,185 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-31 16:54:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,415 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-31 16:54:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:15,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 16:54:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,418 INFO L225 Difference]: With dead ends: 12 [2019-01-31 16:54:15,418 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 16:54:15,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 16:54:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 16:54:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 16:54:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-31 16:54:15,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-31 16:54:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,423 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-31 16:54:15,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-31 16:54:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 16:54:15,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,424 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 16:54:15,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-31 16:54:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:15,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:15,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 16:54:15,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:15,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:15,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-31 16:54:15,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 16:54:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 16:54:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 16:54:15,602 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-31 16:54:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,921 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-31 16:54:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:15,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 16:54:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,925 INFO L225 Difference]: With dead ends: 11 [2019-01-31 16:54:15,925 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 16:54:15,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-31 16:54:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 16:54:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 16:54:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 16:54:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 16:54:15,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-31 16:54:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,930 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-31 16:54:15,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 16:54:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-31 16:54:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 16:54:15,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,931 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-31 16:54:15,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-31 16:54:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:16,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:16,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:16,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:16,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:16,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:16,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:16,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:16,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:16,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 16:54:16,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:16,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:16,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:16,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 16:54:16,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-31 16:54:16,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 16:54:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 16:54:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:16,505 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-31 16:54:16,844 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-31 16:54:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,069 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 16:54:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 16:54:17,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 16:54:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,072 INFO L225 Difference]: With dead ends: 17 [2019-01-31 16:54:17,072 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:17,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-31 16:54:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 16:54:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-31 16:54:17,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-31 16:54:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,078 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-31 16:54:17,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 16:54:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-31 16:54:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 16:54:17,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,079 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-31 16:54:17,079 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-31 16:54:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:17,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:17,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:17,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:17,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:17,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:17,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:17,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:17,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:17,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:17,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:17,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:17,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:17,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-31 16:54:17,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-31 16:54:17,828 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-31 16:54:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,219 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-31 16:54:18,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:18,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-31 16:54:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,220 INFO L225 Difference]: With dead ends: 18 [2019-01-31 16:54:18,220 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 16:54:18,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 16:54:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 16:54:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 16:54:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-31 16:54:18,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-31 16:54:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,225 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-31 16:54:18,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-31 16:54:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 16:54:18,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,226 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-31 16:54:18,226 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-31 16:54:18,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:18,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:18,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 16:54:18,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:18,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:18,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-31 16:54:18,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:18,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 16:54:18,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 16:54:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-31 16:54:18,438 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-31 16:54:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,554 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-31 16:54:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:18,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-31 16:54:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,555 INFO L225 Difference]: With dead ends: 15 [2019-01-31 16:54:18,555 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 16:54:18,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 16:54:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 16:54:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 16:54:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 16:54:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-31 16:54:18,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-31 16:54:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,561 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-31 16:54:18,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 16:54:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-31 16:54:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 16:54:18,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,562 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-31 16:54:18,563 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-31 16:54:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:18,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:18,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:18,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:18,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:18,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:18,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:18,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:18,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 16:54:18,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:19,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:19,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:19,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 16:54:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-31 16:54:19,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 16:54:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 16:54:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:19,145 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-31 16:54:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,771 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-31 16:54:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:19,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-31 16:54:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,773 INFO L225 Difference]: With dead ends: 23 [2019-01-31 16:54:19,773 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 16:54:19,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-31 16:54:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 16:54:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 16:54:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 16:54:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-31 16:54:19,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-31 16:54:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,781 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-31 16:54:19,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 16:54:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-31 16:54:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 16:54:19,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,782 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-31 16:54:19,782 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-31 16:54:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:20,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:20,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:20,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:20,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:20,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:20,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:20,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:20,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:20,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:20,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:20,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:20,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:20,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-31 16:54:20,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:20,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:20,371 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-31 16:54:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:21,184 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-31 16:54:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:21,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-31 16:54:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:21,185 INFO L225 Difference]: With dead ends: 24 [2019-01-31 16:54:21,185 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 16:54:21,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 16:54:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-31 16:54:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 16:54:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-31 16:54:21,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-31 16:54:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:21,193 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-31 16:54:21,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-31 16:54:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 16:54:21,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:21,194 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-31 16:54:21,194 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-31 16:54:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:21,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:21,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:21,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:21,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:21,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:21,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 16:54:21,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:21,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:21,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:21,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-31 16:54:21,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:21,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 16:54:21,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 16:54:21,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-31 16:54:21,643 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-31 16:54:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:21,734 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-31 16:54:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:21,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-31 16:54:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:21,737 INFO L225 Difference]: With dead ends: 19 [2019-01-31 16:54:21,737 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 16:54:21,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-31 16:54:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 16:54:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 16:54:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 16:54:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-31 16:54:21,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-31 16:54:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-31 16:54:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 16:54:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-31 16:54:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 16:54:21,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:21,744 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-31 16:54:21,744 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-31 16:54:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:22,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:22,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:22,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:22,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:22,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:22,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:22,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:22,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:22,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:22,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:22,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:22,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:22,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:22,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 16:54:22,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:22,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:22,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:22,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:22,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 16:54:22,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-31 16:54:22,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:22,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 16:54:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 16:54:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:22,904 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-31 16:54:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:23,752 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-31 16:54:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:54:23,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-31 16:54:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:23,754 INFO L225 Difference]: With dead ends: 29 [2019-01-31 16:54:23,754 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 16:54:23,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-31 16:54:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 16:54:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 16:54:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 16:54:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-31 16:54:23,762 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-31 16:54:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:23,763 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-31 16:54:23,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 16:54:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-31 16:54:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 16:54:23,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:23,764 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-31 16:54:23,764 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-31 16:54:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:23,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:23,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:24,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:24,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:24,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:24,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:24,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:24,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:24,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:24,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:24,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:24,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:24,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:24,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:24,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:24,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:24,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:24,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-31 16:54:24,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:24,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:24,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-31 16:54:24,570 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-31 16:54:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:25,290 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-31 16:54:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:25,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-31 16:54:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:25,291 INFO L225 Difference]: With dead ends: 30 [2019-01-31 16:54:25,291 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 16:54:25,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 16:54:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-31 16:54:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 16:54:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-31 16:54:25,299 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-31 16:54:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:25,300 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-31 16:54:25,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-31 16:54:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-31 16:54:25,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:25,300 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-31 16:54:25,301 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-31 16:54:25,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:25,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:25,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:25,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:25,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:25,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:25,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:25,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:25,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 16:54:25,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:25,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:25,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:25,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:25,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-31 16:54:25,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 16:54:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 16:54:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 16:54:25,671 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-31 16:54:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:26,083 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-31 16:54:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:26,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-31 16:54:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:26,085 INFO L225 Difference]: With dead ends: 23 [2019-01-31 16:54:26,085 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 16:54:26,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-31 16:54:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 16:54:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 16:54:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 16:54:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-31 16:54:26,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-31 16:54:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:26,092 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-31 16:54:26,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 16:54:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-31 16:54:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 16:54:26,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:26,093 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-31 16:54:26,093 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-31 16:54:26,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:26,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:26,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:26,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:26,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:26,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:26,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:26,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:26,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:26,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:26,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:26,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:26,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:26,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-31 16:54:26,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:26,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:26,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:26,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:26,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-31 16:54:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-31 16:54:27,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:27,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 16:54:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 16:54:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:27,122 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-31 16:54:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:28,424 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-31 16:54:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:54:28,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-31 16:54:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:28,426 INFO L225 Difference]: With dead ends: 35 [2019-01-31 16:54:28,426 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 16:54:28,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-31 16:54:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 16:54:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 16:54:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 16:54:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-31 16:54:28,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-31 16:54:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:28,435 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-31 16:54:28,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 16:54:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-31 16:54:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 16:54:28,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:28,436 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-31 16:54:28,436 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-31 16:54:28,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:28,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:28,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:29,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:29,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:29,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:29,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:29,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-31 16:54:29,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:29,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:29,530 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-31 16:54:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:30,368 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-31 16:54:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:54:30,369 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-31 16:54:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:30,370 INFO L225 Difference]: With dead ends: 36 [2019-01-31 16:54:30,370 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 16:54:30,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 16:54:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-31 16:54:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 16:54:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-31 16:54:30,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-31 16:54:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:30,379 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-31 16:54:30,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-31 16:54:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 16:54:30,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:30,379 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-31 16:54:30,379 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-31 16:54:30,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:30,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:30,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:30,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:30,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:31,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-31 16:54:31,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-31 16:54:31,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 16:54:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 16:54:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-31 16:54:31,168 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-31 16:54:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,299 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-31 16:54:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:31,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-31 16:54:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,301 INFO L225 Difference]: With dead ends: 27 [2019-01-31 16:54:31,301 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 16:54:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-31 16:54:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 16:54:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 16:54:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 16:54:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-31 16:54:31,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-31 16:54:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,312 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-31 16:54:31,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 16:54:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-31 16:54:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 16:54:31,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,313 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-31 16:54:31,313 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-31 16:54:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:31,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:31,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:31,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:31,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:32,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:32,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-31 16:54:32,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:32,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:32,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-31 16:54:33,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-31 16:54:33,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 16:54:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 16:54:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:33,046 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-31 16:54:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,513 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-31 16:54:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:54:34,514 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-31 16:54:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,515 INFO L225 Difference]: With dead ends: 41 [2019-01-31 16:54:34,515 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 16:54:34,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-31 16:54:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 16:54:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 16:54:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 16:54:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-31 16:54:34,532 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-31 16:54:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,533 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-31 16:54:34,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 16:54:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-31 16:54:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 16:54:34,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,534 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-31 16:54:34,535 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-31 16:54:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:35,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:35,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:35,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:35,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:35,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:35,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:35,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:35,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:35,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:35,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-31 16:54:35,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:35,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:54:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:54:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:35,815 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-31 16:54:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:37,198 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-31 16:54:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:54:37,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-31 16:54:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:37,199 INFO L225 Difference]: With dead ends: 42 [2019-01-31 16:54:37,200 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 16:54:37,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 16:54:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-31 16:54:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 16:54:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-31 16:54:37,209 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-31 16:54:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:37,210 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-31 16:54:37,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:54:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-31 16:54:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 16:54:37,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:37,210 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-31 16:54:37,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-31 16:54:37,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:37,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:37,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:37,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:37,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:37,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:37,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 16:54:37,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:37,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:37,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-31 16:54:37,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:37,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 16:54:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 16:54:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-31 16:54:37,763 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-31 16:54:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:38,218 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-31 16:54:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:54:38,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-31 16:54:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:38,219 INFO L225 Difference]: With dead ends: 31 [2019-01-31 16:54:38,219 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 16:54:38,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-31 16:54:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 16:54:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 16:54:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 16:54:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-31 16:54:38,230 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-31 16:54:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:38,230 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-31 16:54:38,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 16:54:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-31 16:54:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 16:54:38,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:38,231 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-31 16:54:38,231 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-31 16:54:38,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:39,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:39,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:39,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:39,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:39,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:39,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-31 16:54:39,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:39,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:39,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-31 16:54:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-31 16:54:40,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:40,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 16:54:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 16:54:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:40,344 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-31 16:54:41,495 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-31 16:54:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:42,509 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-31 16:54:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:54:42,509 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-31 16:54:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:42,510 INFO L225 Difference]: With dead ends: 47 [2019-01-31 16:54:42,510 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 16:54:42,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 16:54:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 16:54:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 16:54:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 16:54:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-31 16:54:42,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-31 16:54:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-31 16:54:42,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 16:54:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-31 16:54:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 16:54:42,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:42,523 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-31 16:54:42,524 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-31 16:54:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:43,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:43,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:43,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:43,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:43,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:44,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:44,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:44,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:44,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:44,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:44,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:44,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:44,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-31 16:54:44,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:44,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:54:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:54:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:44,549 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-31 16:54:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:45,811 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-31 16:54:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:54:45,811 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-31 16:54:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:45,812 INFO L225 Difference]: With dead ends: 48 [2019-01-31 16:54:45,812 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 16:54:45,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 16:54:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-31 16:54:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 16:54:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-31 16:54:45,826 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-31 16:54:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:45,826 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-31 16:54:45,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:54:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-31 16:54:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 16:54:45,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:45,827 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-31 16:54:45,828 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-31 16:54:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:46,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:46,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:46,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:46,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:46,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 16:54:46,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:46,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:46,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-31 16:54:46,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:46,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 16:54:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 16:54:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-31 16:54:46,492 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-31 16:54:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:46,695 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-31 16:54:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:54:46,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-31 16:54:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:46,698 INFO L225 Difference]: With dead ends: 35 [2019-01-31 16:54:46,698 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 16:54:46,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-31 16:54:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 16:54:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 16:54:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 16:54:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-31 16:54:46,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-31 16:54:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:46,714 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-31 16:54:46,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 16:54:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-31 16:54:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 16:54:46,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:46,715 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-31 16:54:46,715 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-31 16:54:46,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:46,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:47,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:47,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:47,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:47,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:47,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:47,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:47,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:47,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:48,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:48,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-31 16:54:48,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:48,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:48,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-31 16:54:49,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:49,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-31 16:54:49,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:49,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 16:54:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 16:54:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:49,829 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-31 16:54:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:51,749 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-31 16:54:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:54:51,750 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-31 16:54:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:51,751 INFO L225 Difference]: With dead ends: 53 [2019-01-31 16:54:51,751 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 16:54:51,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-31 16:54:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 16:54:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 16:54:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 16:54:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-31 16:54:51,764 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-31 16:54:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:51,764 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-31 16:54:51,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 16:54:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-31 16:54:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 16:54:51,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:51,765 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-31 16:54:51,765 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-31 16:54:51,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:52,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:52,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:52,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:52,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:52,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:53,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:53,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:54:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:53,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:53,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:54:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:53,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-31 16:54:53,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:53,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:54:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:54:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:53,727 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-31 16:54:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:55,454 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-31 16:54:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:54:55,454 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-31 16:54:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:55,455 INFO L225 Difference]: With dead ends: 54 [2019-01-31 16:54:55,455 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 16:54:55,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 16:54:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-31 16:54:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 16:54:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-31 16:54:55,471 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-31 16:54:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:55,471 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-31 16:54:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:54:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-31 16:54:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 16:54:55,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:55,472 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-31 16:54:55,472 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-31 16:54:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:55,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:55,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:55,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:55,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:55,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:55,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:55,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-31 16:54:55,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:55,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:55,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:56,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-31 16:54:56,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:56,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 16:54:56,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 16:54:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-31 16:54:56,010 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-31 16:54:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:56,240 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-31 16:54:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:54:56,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-31 16:54:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:56,241 INFO L225 Difference]: With dead ends: 39 [2019-01-31 16:54:56,241 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 16:54:56,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-31 16:54:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 16:54:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 16:54:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 16:54:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-31 16:54:56,261 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-31 16:54:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:56,261 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-31 16:54:56,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 16:54:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-31 16:54:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 16:54:56,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:56,262 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-31 16:54:56,262 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-31 16:54:56,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:56,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:57,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:57,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:57,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:57,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:57,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:57,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:57,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:57,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:57,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:57,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:57,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:57,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:54:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:57,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:57,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:54:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-31 16:54:57,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:57,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:54:57,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:57,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:57,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:54:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-31 16:54:59,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-31 16:54:59,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:59,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 16:54:59,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 16:54:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:59,081 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-31 16:55:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:01,380 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-31 16:55:01,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 16:55:01,380 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-31 16:55:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:01,381 INFO L225 Difference]: With dead ends: 59 [2019-01-31 16:55:01,381 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 16:55:01,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-31 16:55:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 16:55:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 16:55:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 16:55:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-31 16:55:01,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-31 16:55:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:01,397 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-31 16:55:01,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 16:55:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-31 16:55:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 16:55:01,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:01,398 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-31 16:55:01,398 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-31 16:55:01,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:02,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:02,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:02,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:02,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:02,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:02,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:02,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:02,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:02,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:03,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:03,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:03,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:03,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:55:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:03,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:03,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:03,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:03,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:03,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:55:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:03,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-31 16:55:03,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:03,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 16:55:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 16:55:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:55:03,795 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-31 16:55:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:05,888 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-31 16:55:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:55:05,888 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-31 16:55:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:05,889 INFO L225 Difference]: With dead ends: 60 [2019-01-31 16:55:05,889 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 16:55:05,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 16:55:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-31 16:55:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 16:55:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-31 16:55:05,904 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-31 16:55:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:05,904 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-31 16:55:05,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 16:55:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-31 16:55:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-31 16:55:05,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:05,904 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-31 16:55:05,904 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-31 16:55:05,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:05,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:05,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:06,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:06,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:06,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:06,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:06,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:06,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:06,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:06,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:06,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 16:55:06,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:06,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:06,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:06,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-31 16:55:06,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:06,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 16:55:06,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 16:55:06,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-31 16:55:06,754 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-31 16:55:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:07,011 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-31 16:55:07,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:55:07,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-31 16:55:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:07,012 INFO L225 Difference]: With dead ends: 43 [2019-01-31 16:55:07,012 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 16:55:07,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-31 16:55:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 16:55:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 16:55:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 16:55:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-31 16:55:07,031 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-31 16:55:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:07,031 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-31 16:55:07,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 16:55:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-31 16:55:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 16:55:07,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:07,032 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-31 16:55:07,032 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-31 16:55:07,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:07,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:07,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:08,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:08,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:08,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:08,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:08,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:08,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:08,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:08,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:08,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:08,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:08,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:09,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:09,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:09,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:09,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:55:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-31 16:55:09,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:09,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:09,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:09,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:09,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:55:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-31 16:55:10,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:10,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-31 16:55:10,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:10,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 16:55:10,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 16:55:10,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:10,544 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-31 16:55:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:13,179 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-31 16:55:13,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 16:55:13,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-31 16:55:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:13,180 INFO L225 Difference]: With dead ends: 65 [2019-01-31 16:55:13,181 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 16:55:13,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 16:55:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 16:55:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 16:55:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 16:55:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-31 16:55:13,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-31 16:55:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:13,205 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-31 16:55:13,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 16:55:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-31 16:55:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 16:55:13,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:13,206 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-31 16:55:13,206 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-31 16:55:13,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:14,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:14,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:14,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:14,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:14,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:14,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:14,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:15,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:15,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:15,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:15,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:55:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:15,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:15,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:15,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:15,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:15,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:55:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:15,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:15,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-31 16:55:15,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:15,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 16:55:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 16:55:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:55:15,897 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-31 16:55:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:18,327 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-31 16:55:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:55:18,327 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-31 16:55:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:18,328 INFO L225 Difference]: With dead ends: 66 [2019-01-31 16:55:18,328 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 16:55:18,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 16:55:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-31 16:55:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-31 16:55:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-31 16:55:18,351 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-31 16:55:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:18,351 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-31 16:55:18,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 16:55:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-31 16:55:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-31 16:55:18,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:18,352 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-31 16:55:18,352 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-31 16:55:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:19,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:19,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:19,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:19,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 16:55:19,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:19,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-31 16:55:19,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:19,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 16:55:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 16:55:19,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-31 16:55:19,557 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-31 16:55:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:19,849 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-31 16:55:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:55:19,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-31 16:55:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:19,852 INFO L225 Difference]: With dead ends: 47 [2019-01-31 16:55:19,852 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 16:55:19,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 16:55:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 16:55:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 16:55:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 16:55:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-31 16:55:19,869 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-31 16:55:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:19,869 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-31 16:55:19,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 16:55:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-31 16:55:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 16:55:19,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:19,869 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-31 16:55:19,870 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-31 16:55:19,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:19,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:19,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:20,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:20,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:20,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:20,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:20,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:20,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:20,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:20,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:20,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:20,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:20,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:21,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:21,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:55:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-31 16:55:22,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:22,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:22,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:55:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-31 16:55:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-31 16:55:23,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:23,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 16:55:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 16:55:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:23,434 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-31 16:55:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:26,894 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-31 16:55:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 16:55:26,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-31 16:55:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:26,895 INFO L225 Difference]: With dead ends: 71 [2019-01-31 16:55:26,895 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 16:55:26,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-31 16:55:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 16:55:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 16:55:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 16:55:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-31 16:55:26,914 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-31 16:55:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:26,915 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-31 16:55:26,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 16:55:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-31 16:55:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 16:55:26,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:26,915 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-31 16:55:26,915 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-31 16:55:26,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:26,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:28,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:28,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:28,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:28,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:28,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:28,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:28,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:28,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:29,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:29,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:29,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:29,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:55:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:29,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:29,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:29,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:29,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:29,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:55:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:30,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-31 16:55:30,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:30,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 16:55:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 16:55:30,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:55:30,004 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-31 16:55:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:32,988 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-31 16:55:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:55:32,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-31 16:55:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:32,989 INFO L225 Difference]: With dead ends: 72 [2019-01-31 16:55:32,989 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 16:55:32,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 16:55:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-31 16:55:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 16:55:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-31 16:55:33,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-31 16:55:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:33,008 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-31 16:55:33,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 16:55:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-31 16:55:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-31 16:55:33,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:33,009 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-31 16:55:33,009 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-31 16:55:33,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:33,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:33,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:33,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:33,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:33,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:33,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:33,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:33,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:33,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-31 16:55:33,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:33,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:33,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:34,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-31 16:55:34,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:34,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 16:55:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 16:55:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-31 16:55:34,737 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-31 16:55:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:35,079 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-31 16:55:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:55:35,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-31 16:55:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:35,080 INFO L225 Difference]: With dead ends: 51 [2019-01-31 16:55:35,080 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 16:55:35,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 16:55:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 16:55:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 16:55:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 16:55:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-31 16:55:35,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-31 16:55:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:35,100 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-31 16:55:35,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 16:55:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-31 16:55:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 16:55:35,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:35,100 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-31 16:55:35,101 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-31 16:55:35,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:35,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:35,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:36,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:36,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:36,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:36,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:36,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:36,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:36,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:36,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:37,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:37,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:37,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:37,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:55:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-31 16:55:37,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:37,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:37,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:37,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:37,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:55:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-31 16:55:39,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:39,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-31 16:55:39,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:39,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 16:55:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 16:55:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:39,550 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-31 16:55:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:43,352 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-31 16:55:43,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 16:55:43,352 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-31 16:55:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:43,353 INFO L225 Difference]: With dead ends: 77 [2019-01-31 16:55:43,353 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 16:55:43,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-31 16:55:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 16:55:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 16:55:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 16:55:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-31 16:55:43,374 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-31 16:55:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:43,374 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-31 16:55:43,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 16:55:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-31 16:55:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 16:55:43,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:43,374 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-31 16:55:43,375 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-31 16:55:43,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:43,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:43,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:44,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:44,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:44,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:44,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:44,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:44,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:44,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:44,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:45,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:46,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:46,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:55:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:46,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:46,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:46,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:55:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:46,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:46,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-31 16:55:46,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:46,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 16:55:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 16:55:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:55:46,978 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-31 16:55:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:50,210 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-31 16:55:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:55:50,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-31 16:55:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:50,211 INFO L225 Difference]: With dead ends: 78 [2019-01-31 16:55:50,211 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 16:55:50,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 16:55:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-31 16:55:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 16:55:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-31 16:55:50,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-31 16:55:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:50,233 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-31 16:55:50,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 16:55:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-31 16:55:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 16:55:50,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:50,234 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-31 16:55:50,234 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-31 16:55:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:50,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:50,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:50,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:50,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:50,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:50,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:50,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:50,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:50,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:50,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 16:55:50,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:50,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:50,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:51,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-31 16:55:51,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:51,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 16:55:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 16:55:51,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-31 16:55:51,283 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-31 16:55:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:51,693 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-31 16:55:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:55:51,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-31 16:55:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:51,694 INFO L225 Difference]: With dead ends: 55 [2019-01-31 16:55:51,694 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 16:55:51,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-31 16:55:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 16:55:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 16:55:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 16:55:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-31 16:55:51,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-31 16:55:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:51,717 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-31 16:55:51,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 16:55:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-31 16:55:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 16:55:51,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:51,718 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-31 16:55:51,718 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-31 16:55:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:51,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:51,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:53,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:53,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:53,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:53,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:53,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:53,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:53,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:53,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:53,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:53,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:53,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:54,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:55:54,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:54,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:54,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:55:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-31 16:55:54,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:54,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:55:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:54,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:54,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:55:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-31 16:55:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:57,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-31 16:55:57,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:57,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 16:55:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 16:55:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:57,393 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-31 16:56:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:01,648 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-31 16:56:01,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 16:56:01,649 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-31 16:56:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:01,650 INFO L225 Difference]: With dead ends: 83 [2019-01-31 16:56:01,650 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 16:56:01,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-31 16:56:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 16:56:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 16:56:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 16:56:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-31 16:56:01,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-31 16:56:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:01,679 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-31 16:56:01,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 16:56:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-31 16:56:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 16:56:01,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:01,680 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-31 16:56:01,680 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-31 16:56:01,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:01,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:01,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:03,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:03,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:03,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:03,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:03,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:03,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:03,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:03,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:03,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:56:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:04,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:04,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:56:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:05,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:05,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:56:05,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:05,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:05,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:56:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:05,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:05,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-31 16:56:05,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:05,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 16:56:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 16:56:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:56:05,859 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-31 16:56:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:09,646 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-31 16:56:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 16:56:09,647 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-31 16:56:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:09,648 INFO L225 Difference]: With dead ends: 84 [2019-01-31 16:56:09,648 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 16:56:09,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:56:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 16:56:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-31 16:56:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 16:56:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-31 16:56:09,673 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-31 16:56:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:09,673 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-31 16:56:09,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 16:56:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-31 16:56:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 16:56:09,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:09,674 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-31 16:56:09,674 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-31 16:56:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:09,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:10,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:10,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:10,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:10,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:10,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:10,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:10,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:10,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 16:56:10,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:10,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:10,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:11,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:11,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-31 16:56:11,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:11,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 16:56:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 16:56:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-31 16:56:11,281 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-31 16:56:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:11,752 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-31 16:56:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:56:11,753 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-31 16:56:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:11,753 INFO L225 Difference]: With dead ends: 59 [2019-01-31 16:56:11,754 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 16:56:11,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-01-31 16:56:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 16:56:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 16:56:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 16:56:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-31 16:56:11,778 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-31 16:56:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:11,778 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-31 16:56:11,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 16:56:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-31 16:56:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 16:56:11,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:11,779 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-31 16:56:11,779 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:11,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-31 16:56:11,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:11,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:11,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:13,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:13,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:13,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:13,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:13,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:13,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:13,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:13,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:13,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:13,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:15,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:56:15,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:15,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:15,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:56:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-31 16:56:15,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:16,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:56:16,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:16,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:16,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:56:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-31 16:56:17,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:17,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-31 16:56:17,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 16:56:17,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 16:56:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:56:17,981 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-31 16:56:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:23,101 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-31 16:56:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 16:56:23,102 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-31 16:56:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:23,103 INFO L225 Difference]: With dead ends: 89 [2019-01-31 16:56:23,103 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 16:56:23,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-31 16:56:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 16:56:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 16:56:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 16:56:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-31 16:56:23,131 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-31 16:56:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:23,131 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-31 16:56:23,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 16:56:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-31 16:56:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 16:56:23,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:23,131 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-31 16:56:23,132 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-31 16:56:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:23,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:23,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:24,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:24,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:24,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:24,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:24,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:24,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:24,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:24,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:24,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:26,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:56:26,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:26,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:26,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:56:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:26,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:27,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:56:27,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:27,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:27,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:56:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-31 16:56:27,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:27,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 16:56:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 16:56:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:56:27,723 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-31 16:56:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:32,248 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-31 16:56:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 16:56:32,248 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-31 16:56:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:32,249 INFO L225 Difference]: With dead ends: 90 [2019-01-31 16:56:32,249 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 16:56:32,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 16:56:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-31 16:56:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 16:56:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-31 16:56:32,279 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-31 16:56:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:32,279 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-31 16:56:32,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 16:56:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-31 16:56:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-31 16:56:32,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:32,280 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-31 16:56:32,280 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-31 16:56:32,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:32,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:32,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:32,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:32,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:32,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:32,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:32,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:32,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:33,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-31 16:56:33,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:33,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:33,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-31 16:56:33,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:33,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 16:56:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 16:56:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-31 16:56:33,704 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-31 16:56:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:34,187 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-31 16:56:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 16:56:34,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-31 16:56:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:34,187 INFO L225 Difference]: With dead ends: 63 [2019-01-31 16:56:34,188 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 16:56:34,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 16:56:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 16:56:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 16:56:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 16:56:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-31 16:56:34,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-31 16:56:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:34,216 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-31 16:56:34,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 16:56:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-31 16:56:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 16:56:34,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:34,216 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-31 16:56:34,217 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-31 16:56:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:34,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:36,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:36,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:36,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:36,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:36,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:37,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:37,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:37,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:39,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:56:39,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:39,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:39,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:56:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-31 16:56:39,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:39,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:56:39,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:39,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:39,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:56:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-31 16:56:41,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:41,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-31 16:56:41,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:41,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 16:56:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 16:56:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:41,676 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-31 16:56:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:47,081 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-31 16:56:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-31 16:56:47,082 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-31 16:56:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:47,082 INFO L225 Difference]: With dead ends: 95 [2019-01-31 16:56:47,083 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 16:56:47,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-31 16:56:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 16:56:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 16:56:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 16:56:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-31 16:56:47,114 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-31 16:56:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:47,114 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-31 16:56:47,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 16:56:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-31 16:56:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 16:56:47,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:47,115 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-31 16:56:47,115 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-31 16:56:47,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:47,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:47,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:49,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:49,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:49,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:49,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:49,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:49,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:49,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:49,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:49,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:51,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:56:51,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:51,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:51,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:56:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:51,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:51,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:56:51,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:51,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:51,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:56:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:52,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:52,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-31 16:56:52,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:52,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 16:56:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 16:56:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:56:52,418 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-31 16:56:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:57,564 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-31 16:56:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 16:56:57,564 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-31 16:56:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:57,565 INFO L225 Difference]: With dead ends: 96 [2019-01-31 16:56:57,565 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 16:56:57,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:56:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 16:56:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-31 16:56:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 16:56:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-31 16:56:57,595 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-31 16:56:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:57,596 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-31 16:56:57,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 16:56:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-31 16:56:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-31 16:56:57,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:57,596 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-31 16:56:57,596 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-31 16:56:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:58,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:58,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:58,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:58,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:58,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:58,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:58,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 16:56:58,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:58,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:58,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:59,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:59,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-31 16:56:59,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 16:56:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 16:56:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-31 16:56:59,419 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-31 16:56:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:59,958 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-31 16:56:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 16:56:59,959 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-31 16:56:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:59,959 INFO L225 Difference]: With dead ends: 67 [2019-01-31 16:56:59,959 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 16:56:59,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-01-31 16:56:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 16:56:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 16:56:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 16:56:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-31 16:56:59,989 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-31 16:56:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:59,990 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-31 16:56:59,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 16:56:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-31 16:56:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 16:56:59,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:59,990 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-31 16:56:59,991 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-31 16:56:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:59,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:59,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:02,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:02,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:02,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:02,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:02,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:02,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:02,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:02,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:02,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:02,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:02,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:05,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:57:05,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:05,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:05,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:57:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-31 16:57:05,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:05,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:57:05,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:05,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:05,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:57:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-31 16:57:08,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:08,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-31 16:57:08,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 16:57:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 16:57:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:57:08,443 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-31 16:57:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:14,628 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-31 16:57:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-31 16:57:14,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-31 16:57:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:14,629 INFO L225 Difference]: With dead ends: 101 [2019-01-31 16:57:14,629 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 16:57:14,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-31 16:57:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 16:57:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 16:57:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 16:57:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-31 16:57:14,662 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-31 16:57:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-31 16:57:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 16:57:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-31 16:57:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 16:57:14,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:14,663 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-31 16:57:14,663 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-31 16:57:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:14,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:14,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:17,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:17,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:17,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:17,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:17,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:17,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:17,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:17,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:20,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:57:20,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:57:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:20,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:20,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:57:20,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:57:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:21,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:21,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-31 16:57:21,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:21,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 16:57:21,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 16:57:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:57:21,120 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-31 16:57:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:25,964 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-31 16:57:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 16:57:25,964 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-31 16:57:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:25,965 INFO L225 Difference]: With dead ends: 102 [2019-01-31 16:57:25,965 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 16:57:25,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 16:57:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-31 16:57:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 16:57:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-31 16:57:25,999 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-31 16:57:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:25,999 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-31 16:57:25,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 16:57:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-31 16:57:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-31 16:57:26,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:26,000 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-31 16:57:26,000 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-31 16:57:26,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:26,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:27,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:27,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:27,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:27,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:27,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:27,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:27,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 16:57:27,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:27,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:27,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:28,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:28,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-31 16:57:28,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:28,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 16:57:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 16:57:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-31 16:57:28,645 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-31 16:57:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:29,237 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-31 16:57:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 16:57:29,237 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-31 16:57:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:29,238 INFO L225 Difference]: With dead ends: 71 [2019-01-31 16:57:29,238 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 16:57:29,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-31 16:57:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 16:57:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 16:57:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 16:57:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-31 16:57:29,273 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-31 16:57:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:29,273 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-31 16:57:29,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 16:57:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-31 16:57:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 16:57:29,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:29,274 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-31 16:57:29,274 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-31 16:57:29,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:29,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:29,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:31,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:31,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:31,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:31,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:31,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:31,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:31,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:31,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:31,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:34,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:57:34,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:34,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:34,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:57:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-31 16:57:34,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:34,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:57:34,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:34,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:34,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:57:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-31 16:57:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:37,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-31 16:57:37,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 16:57:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 16:57:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:37,641 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-31 16:57:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:45,186 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-31 16:57:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-31 16:57:45,186 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-31 16:57:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:45,187 INFO L225 Difference]: With dead ends: 107 [2019-01-31 16:57:45,187 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 16:57:45,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-31 16:57:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 16:57:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 16:57:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 16:57:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-31 16:57:45,225 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-31 16:57:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:45,226 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-31 16:57:45,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 16:57:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-31 16:57:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 16:57:45,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:45,226 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-31 16:57:45,226 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-31 16:57:45,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:45,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:45,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:47,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:47,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:47,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:47,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:47,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:47,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:47,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:47,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:47,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:50,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:57:50,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:50,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:50,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:57:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:50,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:50,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:57:50,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:50,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:50,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:57:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:52,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:52,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-31 16:57:52,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 16:57:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 16:57:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:57:52,322 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-31 16:57:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:58,774 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-31 16:57:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 16:57:58,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-31 16:57:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:58,775 INFO L225 Difference]: With dead ends: 108 [2019-01-31 16:57:58,775 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 16:57:58,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:57:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 16:57:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-31 16:57:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 16:57:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-31 16:57:58,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-31 16:57:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:58,814 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-31 16:57:58,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 16:57:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-31 16:57:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 16:57:58,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:58,815 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-31 16:57:58,815 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-31 16:57:58,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:58,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:58,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:00,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:00,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:00,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:00,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:00,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:00,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:00,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:00,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-31 16:58:00,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:00,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:00,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:01,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:01,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-31 16:58:01,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:01,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 16:58:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 16:58:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-31 16:58:01,529 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-31 16:58:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:02,180 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-31 16:58:02,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 16:58:02,181 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-31 16:58:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:02,181 INFO L225 Difference]: With dead ends: 75 [2019-01-31 16:58:02,181 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 16:58:02,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 16:58:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 16:58:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 16:58:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 16:58:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-31 16:58:02,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-31 16:58:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:02,220 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-31 16:58:02,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 16:58:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-31 16:58:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 16:58:02,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:02,220 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-31 16:58:02,221 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-31 16:58:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:02,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:02,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:05,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:05,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:05,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:05,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:05,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:05,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:05,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:05,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:05,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:05,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:08,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:58:08,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:58:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-31 16:58:08,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:08,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:58:08,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:58:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-31 16:58:11,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:11,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-31 16:58:11,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:11,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 16:58:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 16:58:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:58:11,633 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-31 16:58:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:19,633 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-31 16:58:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-31 16:58:19,633 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-31 16:58:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:19,634 INFO L225 Difference]: With dead ends: 113 [2019-01-31 16:58:19,634 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 16:58:19,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 16:58:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 16:58:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 16:58:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 16:58:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-31 16:58:19,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-31 16:58:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:19,677 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-31 16:58:19,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 16:58:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-31 16:58:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 16:58:19,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:19,677 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-31 16:58:19,677 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-31 16:58:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:19,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:19,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:19,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:19,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:22,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:22,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:22,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:22,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:22,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:22,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:22,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:22,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:26,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:58:26,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:26,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:26,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:58:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:26,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:26,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:58:26,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:26,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:26,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:58:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-31 16:58:27,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:27,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 16:58:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 16:58:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 16:58:27,470 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-31 16:58:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:34,204 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-31 16:58:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 16:58:34,204 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-31 16:58:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:34,205 INFO L225 Difference]: With dead ends: 114 [2019-01-31 16:58:34,205 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 16:58:34,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 16:58:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-31 16:58:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 16:58:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-31 16:58:34,248 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-31 16:58:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:34,248 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-31 16:58:34,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 16:58:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-31 16:58:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 16:58:34,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:34,249 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-31 16:58:34,249 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-31 16:58:34,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:34,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:35,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:35,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:35,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:35,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:35,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:35,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:35,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:35,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 16:58:35,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:35,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:35,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:36,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:36,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-31 16:58:36,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:36,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 16:58:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 16:58:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-31 16:58:36,500 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-31 16:58:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:37,238 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-31 16:58:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 16:58:37,239 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-31 16:58:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:37,239 INFO L225 Difference]: With dead ends: 79 [2019-01-31 16:58:37,240 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 16:58:37,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-31 16:58:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 16:58:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 16:58:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 16:58:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-31 16:58:37,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-31 16:58:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:37,301 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-31 16:58:37,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 16:58:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-31 16:58:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 16:58:37,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:37,302 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-31 16:58:37,302 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-31 16:58:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:37,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:37,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:37,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:37,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:40,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:40,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:40,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:40,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:40,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:40,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:40,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:40,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:41,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:41,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:41,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:44,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:58:44,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:44,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:44,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:58:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-31 16:58:44,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:44,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:58:44,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:44,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:44,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:58:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-31 16:58:48,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:48,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-31 16:58:48,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:48,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 16:58:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 16:58:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:48,273 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-31 16:58:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:57,748 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-31 16:58:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-31 16:58:57,748 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-31 16:58:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:57,749 INFO L225 Difference]: With dead ends: 119 [2019-01-31 16:58:57,749 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 16:58:57,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-31 16:58:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 16:58:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 16:58:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 16:58:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-31 16:58:57,813 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-31 16:58:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:57,813 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-31 16:58:57,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 16:58:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-31 16:58:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 16:58:57,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:57,814 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-31 16:58:57,814 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-31 16:58:57,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:57,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:57,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:01,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:01,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:01,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:01,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:01,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:01,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:01,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:01,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:05,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:59:05,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:05,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:05,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:59:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:05,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:05,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:59:05,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:05,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:05,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:59:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:06,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-31 16:59:06,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:06,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-31 16:59:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-31 16:59:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:59:06,657 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-31 16:59:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:14,799 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-31 16:59:14,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 16:59:14,799 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-31 16:59:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:14,800 INFO L225 Difference]: With dead ends: 120 [2019-01-31 16:59:14,800 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 16:59:14,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:59:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 16:59:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-31 16:59:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 16:59:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-31 16:59:14,854 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-31 16:59:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:14,857 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-31 16:59:14,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-31 16:59:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-31 16:59:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 16:59:14,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:14,858 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-31 16:59:14,858 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:14,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-31 16:59:14,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:14,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:14,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:15,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:15,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:15,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:15,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:15,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 16:59:15,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:15,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:15,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:16,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:16,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-31 16:59:16,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:16,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 16:59:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 16:59:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-31 16:59:16,978 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-31 16:59:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:17,766 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-31 16:59:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 16:59:17,767 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-31 16:59:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:17,768 INFO L225 Difference]: With dead ends: 83 [2019-01-31 16:59:17,768 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 16:59:17,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-31 16:59:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 16:59:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 16:59:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 16:59:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-31 16:59:17,832 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-31 16:59:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:17,832 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-31 16:59:17,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 16:59:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-31 16:59:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 16:59:17,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:17,833 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-31 16:59:17,833 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-31 16:59:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:17,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:17,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:21,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:21,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:21,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:21,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:21,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:21,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:21,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:21,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:21,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:21,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:25,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:59:25,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:25,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:25,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 16:59:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-31 16:59:25,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:25,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:59:25,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:25,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:25,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 16:59:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-31 16:59:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-31 16:59:29,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:29,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-31 16:59:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-31 16:59:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:59:29,354 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-31 16:59:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:39,117 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-31 16:59:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-31 16:59:39,117 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-31 16:59:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:39,118 INFO L225 Difference]: With dead ends: 125 [2019-01-31 16:59:39,118 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 16:59:39,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-31 16:59:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 16:59:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 16:59:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 16:59:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-31 16:59:39,178 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-31 16:59:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:39,178 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-31 16:59:39,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-31 16:59:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-31 16:59:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 16:59:39,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:39,178 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-31 16:59:39,178 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:39,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-31 16:59:39,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:39,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:39,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:42,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:42,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:42,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:42,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:42,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:42,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:42,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:42,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:42,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:47,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 16:59:47,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:47,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:47,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 16:59:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:47,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:47,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 16:59:47,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:47,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:47,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 16:59:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:49,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:49,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-31 16:59:49,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:49,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-31 16:59:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-31 16:59:49,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 16:59:49,119 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-31 16:59:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:57,800 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-31 16:59:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 16:59:57,800 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-31 16:59:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:57,801 INFO L225 Difference]: With dead ends: 126 [2019-01-31 16:59:57,801 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 16:59:57,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:59:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 16:59:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-31 16:59:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 16:59:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-31 16:59:57,854 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-31 16:59:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:57,854 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-31 16:59:57,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-31 16:59:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-31 16:59:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 16:59:57,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:57,855 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-31 16:59:57,855 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-31 16:59:57,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:57,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:57,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:58,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:58,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:58,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:58,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:58,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:58,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:58,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:58,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:58,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-31 16:59:58,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:58,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:58,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:00,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:00,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-31 17:00:00,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:00,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 17:00:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 17:00:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 17:00:00,046 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-31 17:00:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:01,128 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-31 17:00:01,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:00:01,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-31 17:00:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:01,128 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:00:01,129 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:00:01,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-31 17:00:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:00:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 17:00:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 17:00:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-31 17:00:01,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-31 17:00:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:01,181 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-31 17:00:01,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 17:00:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-31 17:00:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 17:00:01,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:01,181 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-31 17:00:01,181 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-31 17:00:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:01,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:01,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:04,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:04,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:04,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:04,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:04,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:04,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:04,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:04,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:04,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:04,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:08,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:00:08,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:08,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:08,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:00:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-31 17:00:08,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:08,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:00:08,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:08,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:08,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:00:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-31 17:00:13,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-31 17:00:13,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:13,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-31 17:00:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-31 17:00:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:00:13,644 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-31 17:00:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:24,478 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-31 17:00:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-31 17:00:24,478 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-31 17:00:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:24,479 INFO L225 Difference]: With dead ends: 131 [2019-01-31 17:00:24,479 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:00:24,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-31 17:00:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:00:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 17:00:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 17:00:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-31 17:00:24,546 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-31 17:00:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:24,546 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-31 17:00:24,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-31 17:00:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-31 17:00:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 17:00:24,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:24,546 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-31 17:00:24,547 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-31 17:00:24,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:24,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:24,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:28,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:28,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:28,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:28,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:28,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:28,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:28,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:28,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:28,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:32,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:00:32,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:32,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:32,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:00:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:32,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:32,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:00:32,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:32,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:32,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:00:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:34,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-31 17:00:34,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:34,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-31 17:00:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-31 17:00:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:00:34,158 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-31 17:00:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:43,641 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-31 17:00:43,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:00:43,642 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-31 17:00:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:43,643 INFO L225 Difference]: With dead ends: 132 [2019-01-31 17:00:43,643 INFO L226 Difference]: Without dead ends: 88 [2019-01-31 17:00:43,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:00:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-31 17:00:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-31 17:00:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-31 17:00:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-31 17:00:43,701 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-31 17:00:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-31 17:00:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-31 17:00:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-31 17:00:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-31 17:00:43,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:43,702 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-31 17:00:43,702 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-31 17:00:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:43,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:43,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:43,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:43,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:44,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:44,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:44,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:44,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:44,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:44,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:44,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:44,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:44,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 17:00:44,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:44,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:44,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:46,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:46,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-31 17:00:46,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:46,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 17:00:46,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 17:00:46,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-31 17:00:46,163 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-31 17:00:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:47,299 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-31 17:00:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:00:47,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-31 17:00:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:47,300 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:00:47,300 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:00:47,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-31 17:00:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:00:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:00:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:00:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-31 17:00:47,396 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-31 17:00:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:47,397 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-31 17:00:47,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 17:00:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-31 17:00:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:00:47,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:47,398 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-31 17:00:47,398 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-31 17:00:47,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:47,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:47,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:51,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:51,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:51,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:51,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:51,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:51,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:51,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:51,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:51,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:51,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:56,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:00:56,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:56,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:56,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:00:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-31 17:00:56,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:56,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:00:56,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:56,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:56,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:01:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-31 17:01:01,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:01,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-31 17:01:01,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:01,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-31 17:01:01,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-31 17:01:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:01:01,496 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-31 17:01:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:13,761 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-31 17:01:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-31 17:01:13,762 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-31 17:01:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:13,763 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:01:13,763 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:01:13,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-31 17:01:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:01:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:01:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:01:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-31 17:01:13,821 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-31 17:01:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:13,821 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-31 17:01:13,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-31 17:01:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-31 17:01:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:01:13,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:13,822 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-31 17:01:13,822 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-31 17:01:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:13,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:13,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:19,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:19,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:19,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:19,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:19,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:19,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:01:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:19,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:23,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:01:23,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:23,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:23,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:01:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:23,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:23,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:01:23,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:23,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:23,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:01:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:25,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:25,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-31 17:01:25,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:25,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-31 17:01:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-31 17:01:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:01:25,535 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-31 17:01:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:35,958 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-31 17:01:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-31 17:01:35,959 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-31 17:01:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:35,959 INFO L225 Difference]: With dead ends: 138 [2019-01-31 17:01:35,960 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:01:35,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:01:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-31 17:01:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 17:01:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-31 17:01:36,024 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-31 17:01:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:36,025 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-31 17:01:36,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-31 17:01:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-31 17:01:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 17:01:36,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:36,025 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-31 17:01:36,025 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-31 17:01:36,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:36,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:36,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:36,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:36,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:36,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:36,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:36,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:36,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:36,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:36,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:37,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 17:01:37,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:37,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:37,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-31 17:01:38,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:01:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:01:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 17:01:38,913 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-31 17:01:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:39,861 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-31 17:01:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:01:39,861 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-31 17:01:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:39,862 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:01:39,862 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:01:39,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-01-31 17:01:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:01:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:01:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:01:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-31 17:01:39,926 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-31 17:01:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:39,926 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-31 17:01:39,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:01:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-31 17:01:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:01:39,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:39,926 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-31 17:01:39,927 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-31 17:01:39,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:39,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:39,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:39,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:39,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:43,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:43,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:43,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:43,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:44,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:44,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:44,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:48,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:01:48,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:48,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:48,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:01:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-31 17:01:48,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:49,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:01:49,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:49,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:49,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:01:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-31 17:01:54,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:54,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-31 17:01:54,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:54,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-31 17:01:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-31 17:01:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:54,731 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-31 17:02:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:07,496 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-31 17:02:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-31 17:02:07,497 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-31 17:02:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:07,497 INFO L225 Difference]: With dead ends: 143 [2019-01-31 17:02:07,497 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:02:07,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-31 17:02:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:02:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:02:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:02:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-31 17:02:07,567 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-31 17:02:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:07,567 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-31 17:02:07,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-31 17:02:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-31 17:02:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:02:07,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:07,567 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-31 17:02:07,568 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-31 17:02:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:07,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:07,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:11,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:11,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:11,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:11,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:11,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:12,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:16,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:02:16,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:16,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:16,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:02:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:16,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:16,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:02:16,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:16,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:16,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:02:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:19,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:19,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-31 17:02:19,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:19,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-31 17:02:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-31 17:02:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:02:19,039 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-31 17:02:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:30,003 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-31 17:02:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-31 17:02:30,003 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-31 17:02:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:30,004 INFO L225 Difference]: With dead ends: 144 [2019-01-31 17:02:30,004 INFO L226 Difference]: Without dead ends: 96 [2019-01-31 17:02:30,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:02:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-31 17:02:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-31 17:02:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:02:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-31 17:02:30,070 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-31 17:02:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-31 17:02:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-31 17:02:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-31 17:02:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 17:02:30,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:30,071 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-31 17:02:30,071 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-31 17:02:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:30,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:30,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:30,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:30,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:30,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:30,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:30,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:30,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:30,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:31,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-31 17:02:31,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:31,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:31,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:32,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:32,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-31 17:02:32,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:32,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 17:02:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 17:02:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-31 17:02:32,935 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-31 17:02:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:34,063 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-31 17:02:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:02:34,063 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-31 17:02:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:34,063 INFO L225 Difference]: With dead ends: 99 [2019-01-31 17:02:34,063 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:02:34,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 17:02:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:02:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:02:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:02:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-31 17:02:34,134 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-31 17:02:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-31 17:02:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 17:02:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-31 17:02:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:02:34,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:34,134 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-31 17:02:34,135 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-31 17:02:34,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:34,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:34,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:38,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:38,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:38,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:38,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:38,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:38,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:38,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:38,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:38,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:38,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:38,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:43,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:02:43,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:43,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:43,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:02:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-31 17:02:43,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:43,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:02:43,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:43,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:43,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:02:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-31 17:02:49,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:49,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-31 17:02:49,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:49,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-31 17:02:49,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-31 17:02:49,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:02:49,928 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-31 17:03:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:03,907 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-31 17:03:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-31 17:03:03,908 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-31 17:03:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:03,909 INFO L225 Difference]: With dead ends: 149 [2019-01-31 17:03:03,909 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:03:03,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-31 17:03:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:03:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:03:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:03:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-31 17:03:03,982 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-31 17:03:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:03,982 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-31 17:03:03,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-31 17:03:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-31 17:03:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:03:03,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:03,983 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-31 17:03:03,983 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-31 17:03:03,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:03,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:03,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:08,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:08,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:08,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:08,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:08,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:08,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:03:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:08,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:14,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:03:14,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:14,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:14,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:03:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:14,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:03:14,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:14,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:14,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:03:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:16,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:16,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-31 17:03:16,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:16,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-31 17:03:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-31 17:03:16,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:03:16,477 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-31 17:03:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:27,376 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-31 17:03:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-31 17:03:27,376 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-31 17:03:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:27,377 INFO L225 Difference]: With dead ends: 150 [2019-01-31 17:03:27,377 INFO L226 Difference]: Without dead ends: 100 [2019-01-31 17:03:27,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:03:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-31 17:03:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-31 17:03:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:03:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-31 17:03:27,451 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-31 17:03:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:27,451 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-31 17:03:27,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-31 17:03:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-31 17:03:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-31 17:03:27,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:27,452 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-31 17:03:27,452 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-31 17:03:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:27,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:28,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:28,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:28,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:28,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:28,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:28,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:28,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:03:28,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:03:28,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 17:03:28,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:28,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:28,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-31 17:03:30,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 17:03:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 17:03:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-31 17:03:30,912 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-31 17:03:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:32,007 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-31 17:03:32,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:03:32,007 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-31 17:03:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:32,007 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:03:32,007 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:03:32,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-31 17:03:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:03:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:03:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:03:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-31 17:03:32,082 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-31 17:03:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:32,082 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-31 17:03:32,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 17:03:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-31 17:03:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:03:32,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:32,083 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-31 17:03:32,083 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-31 17:03:32,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:32,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:32,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:32,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:36,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:36,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:36,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:36,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:36,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:36,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:36,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:36,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:36,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:36,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:36,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:42,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:03:42,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:42,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:42,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:03:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-31 17:03:42,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:42,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:03:42,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:42,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:42,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:03:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-31 17:03:49,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:49,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-31 17:03:49,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:49,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-31 17:03:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-31 17:03:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:03:49,248 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-31 17:04:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:04,527 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-31 17:04:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-31 17:04:04,528 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-31 17:04:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:04,529 INFO L225 Difference]: With dead ends: 155 [2019-01-31 17:04:04,529 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:04:04,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-31 17:04:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:04:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:04:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:04:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-31 17:04:04,602 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-31 17:04:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-31 17:04:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-31 17:04:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-31 17:04:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:04:04,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:04,603 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-31 17:04:04,603 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-31 17:04:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:04,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:04,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:09,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:09,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:09,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:09,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:09,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:09,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:09,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:09,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:15,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:04:15,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:15,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:15,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:04:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:16,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:16,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:04:16,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:16,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:16,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:04:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:18,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-31 17:04:18,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:18,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-31 17:04:18,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-31 17:04:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:04:18,615 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-31 17:04:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:30,320 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-31 17:04:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-31 17:04:30,320 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-31 17:04:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:30,321 INFO L225 Difference]: With dead ends: 156 [2019-01-31 17:04:30,321 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:04:30,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:04:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:04:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-31 17:04:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:04:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-31 17:04:30,397 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-31 17:04:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:30,397 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-31 17:04:30,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-31 17:04:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-31 17:04:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-31 17:04:30,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:30,397 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-31 17:04:30,397 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-31 17:04:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:30,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:30,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:30,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:30,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:31,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:31,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:31,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:31,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:31,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:31,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:31,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:04:31,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:04:31,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 17:04:31,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:31,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:31,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:33,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:33,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-31 17:04:33,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:33,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:04:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:04:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 17:04:33,864 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-31 17:04:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:35,095 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-31 17:04:35,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:04:35,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-31 17:04:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:35,096 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:04:35,096 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:04:35,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-01-31 17:04:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:04:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:04:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:04:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-31 17:04:35,180 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-31 17:04:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:35,181 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-31 17:04:35,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:04:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-31 17:04:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:04:35,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:35,182 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-31 17:04:35,182 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-31 17:04:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:35,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:35,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:40,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:40,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:40,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:40,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:40,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:40,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:40,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:40,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:40,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:40,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:40,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:46,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:04:46,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:04:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-31 17:04:46,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:46,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:04:46,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:04:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-31 17:04:54,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:54,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-31 17:04:54,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:54,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-31 17:04:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-31 17:04:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:04:54,214 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-31 17:05:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:10,008 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-31 17:05:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-31 17:05:10,009 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-31 17:05:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:10,010 INFO L225 Difference]: With dead ends: 161 [2019-01-31 17:05:10,010 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:05:10,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-01-31 17:05:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:05:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:05:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:05:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-31 17:05:10,093 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-31 17:05:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:10,093 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-31 17:05:10,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-31 17:05:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-31 17:05:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:05:10,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:10,094 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-31 17:05:10,094 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-31 17:05:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:10,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:10,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:15,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:15,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:15,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:15,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:15,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:15,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:15,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:15,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:21,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:05:21,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:21,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:21,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:05:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:21,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:21,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:05:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:21,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:21,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:05:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:24,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:24,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-01-31 17:05:24,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:24,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-31 17:05:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-31 17:05:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:05:24,447 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-01-31 17:05:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:36,396 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-31 17:05:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-31 17:05:36,397 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-01-31 17:05:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:36,398 INFO L225 Difference]: With dead ends: 162 [2019-01-31 17:05:36,398 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:05:36,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:05:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:05:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-31 17:05:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:05:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-01-31 17:05:36,483 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-01-31 17:05:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:36,483 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-01-31 17:05:36,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-31 17:05:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-01-31 17:05:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:05:36,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:36,483 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-01-31 17:05:36,484 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-01-31 17:05:36,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:36,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:37,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:37,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:37,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:37,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:37,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:37,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:05:37,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:05:38,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-31 17:05:38,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:38,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:38,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-01-31 17:05:40,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:05:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:05:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-01-31 17:05:40,352 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-01-31 17:05:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:41,626 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-01-31 17:05:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-31 17:05:41,626 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-01-31 17:05:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:41,627 INFO L225 Difference]: With dead ends: 111 [2019-01-31 17:05:41,627 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:05:41,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-01-31 17:05:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:05:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:05:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:05:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-31 17:05:41,711 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-01-31 17:05:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:41,711 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-31 17:05:41,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:05:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-31 17:05:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:05:41,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:41,712 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-31 17:05:41,712 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-01-31 17:05:41,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:47,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:47,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:47,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:47,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:47,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:47,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:47,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:05:47,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:05:47,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:05:47,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:47,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:54,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:05:54,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:54,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:54,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-31 17:05:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-31 17:05:54,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:54,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:05:54,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:54,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:54,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-31 17:06:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-31 17:06:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-01-31 17:06:01,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:01,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-01-31 17:06:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-01-31 17:06:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:06:01,937 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-01-31 17:06:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:18,840 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-01-31 17:06:18,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-01-31 17:06:18,840 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-01-31 17:06:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:18,841 INFO L225 Difference]: With dead ends: 167 [2019-01-31 17:06:18,841 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:06:18,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-01-31 17:06:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:06:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:06:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:06:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-31 17:06:18,932 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-31 17:06:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:18,932 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-31 17:06:18,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-01-31 17:06:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-31 17:06:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:06:18,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:18,933 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-31 17:06:18,933 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-01-31 17:06:18,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:18,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:18,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:18,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:18,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:24,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:24,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:24,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:24,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:24,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:24,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:24,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:24,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:24,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:31,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-31 17:06:31,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-31 17:06:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:31,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:31,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-31 17:06:31,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-31 17:06:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:34,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:34,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-01-31 17:06:34,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:34,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-31 17:06:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-31 17:06:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:06:34,340 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2019-01-31 17:06:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:48,570 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-01-31 17:06:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-31 17:06:48,570 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2019-01-31 17:06:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:48,571 INFO L225 Difference]: With dead ends: 168 [2019-01-31 17:06:48,571 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:06:48,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:06:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:06:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-31 17:06:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:06:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-01-31 17:06:48,661 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-01-31 17:06:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:48,661 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-01-31 17:06:48,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-31 17:06:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-01-31 17:06:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:06:48,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:48,662 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2019-01-31 17:06:48,662 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2019-01-31 17:06:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:49,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:49,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:49,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:49,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:49,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:50,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 17:06:50,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:50,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:50,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2019-01-31 17:06:52,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:52,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 17:06:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 17:06:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-01-31 17:06:52,585 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states. [2019-01-31 17:06:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:53,937 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-01-31 17:06:53,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-31 17:06:53,937 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-01-31 17:06:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:53,938 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:06:53,938 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:06:53,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 167 SyntacticMatches, 108 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-01-31 17:06:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:06:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-31 17:06:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:06:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-31 17:06:54,027 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 111 [2019-01-31 17:06:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:54,027 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-31 17:06:54,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 17:06:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-31 17:06:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-31 17:06:54,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,028 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-31 17:06:54,028 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 81 times [2019-01-31 17:06:54,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:59,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:59,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:59,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:59,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:59,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:59,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:59,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:59,880 INFO L273 TraceCheckSpWp]: Computing forward predicates...