java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:56:18,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:56:18,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:56:18,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:56:18,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:56:18,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:56:18,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:56:18,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:56:18,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:56:18,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:56:18,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:56:18,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:56:18,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:56:18,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:56:18,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:56:18,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:56:18,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:56:18,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:56:18,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:56:18,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:56:18,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:56:18,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:56:18,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:56:18,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:56:18,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:56:18,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:56:18,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:56:18,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:56:18,419 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:56:18,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:56:18,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:56:18,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:56:18,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:56:18,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:56:18,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:56:18,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:56:18,424 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 [2018-12-03 15:56:18,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:56:18,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:56:18,451 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:56:18,451 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:56:18,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:56:18,452 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:56:18,452 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:56:18,452 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:56:18,452 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:56:18,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:56:18,453 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:56:18,453 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:56:18,453 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:56:18,454 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:56:18,454 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:56:18,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:56:18,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:56:18,455 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:56:18,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:56:18,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:56:18,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:56:18,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:56:18,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:56:18,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:56:18,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:56:18,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:56:18,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:56:18,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:56:18,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:56:18,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:56:18,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:56:18,461 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:56:18,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:56:18,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:56:18,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:56:18,462 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:56:18,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:56:18,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:56:18,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:56:18,514 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:56:18,515 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:56:18,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl [2018-12-03 15:56:18,516 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl' [2018-12-03 15:56:18,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:56:18,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:56:18,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:56:18,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:56:18,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:56:18,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,585 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:56:18,585 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:56:18,585 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:56:18,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:56:18,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:56:18,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:56:18,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:56:18,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... [2018-12-03 15:56:18,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:56:18,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:56:18,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:56:18,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:56:18,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:56:18,687 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:56:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:56:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:56:18,847 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:56:18,847 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:56:18,848 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:56:18 BoogieIcfgContainer [2018-12-03 15:56:18,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:56:18,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:56:18,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:56:18,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:56:18,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:18" (1/2) ... [2018-12-03 15:56:18,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ceb053 and model type Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:56:18, skipping insertion in model container [2018-12-03 15:56:18,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:56:18" (2/2) ... [2018-12-03 15:56:18,855 INFO L112 eAbstractionObserver]: Analyzing ICFG Octopussy.bpl [2018-12-03 15:56:18,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:56:18,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:56:18,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:56:18,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:56:18,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:56:18,919 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:56:18,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:56:18,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:56:18,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:56:18,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:56:18,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:56:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:56:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:56:18,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:18,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:56:18,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:18,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 15:56:18,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:56:19,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:56:19,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:56:19,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:56:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:56:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:56:19,118 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:56:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:19,162 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 15:56:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:56:19,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:56:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:19,176 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:56:19,177 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:56:19,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:56:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:56:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:56:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:56:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:56:19,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:56:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:19,219 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:56:19,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:56:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:56:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:56:19,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:19,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:56:19,221 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:19,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 15:56:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,366 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:56:19,368 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 15:56:19,466 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:56:19,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:56:19,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:56:19,658 INFO L272 AbstractInterpreter]: Visited 4 different actions 8 times. Merged at 1 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:56:19,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:56:19,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,705 INFO L192 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 [2018-12-03 15:56:19,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:56:19,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:56:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:56:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:56:19,820 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 15:56:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:19,846 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:56:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:56:19,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:56:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:19,849 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:56:19,849 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:56:19,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:56:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:56:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:56:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:56:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:56:19,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:56:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:19,854 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:56:19,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:56:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:56:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:56:19,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:19,856 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:56:19,856 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:19,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 15:56:19,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:19,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:19,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,946 INFO L192 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 [2018-12-03 15:56:19,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:19,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:19,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:56:19,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:19,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:56:20,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:56:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:56:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:56:20,128 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 15:56:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,180 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:56:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:56:20,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:56:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,183 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:56:20,183 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:56:20,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:56:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:56:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:56:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:56:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:56:20,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:56:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:56:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:56:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:56:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:56:20,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,190 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:56:20,191 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 15:56:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:20,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:20,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:20,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,431 INFO L192 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 [2018-12-03 15:56:20,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:20,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:20,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:20,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:20,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:56:20,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:56:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:56:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:56:20,620 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:56:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,691 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:56:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:56:20,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:56:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,692 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:56:20,692 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:56:20,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:56:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:56:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:56:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:56:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:56:20,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:56:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,697 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:56:20,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:56:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:56:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:56:20,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,698 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:56:20,698 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 15:56:20,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:20,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:20,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:20,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,828 INFO L192 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 [2018-12-03 15:56:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:20,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:56:21,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:56:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:56:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:56:21,052 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 15:56:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,070 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:56:21,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:56:21,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:56:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,074 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:56:21,074 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:56:21,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:56:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:56:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:56:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:56:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:56:21,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:56:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,078 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:56:21,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:56:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:56:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:56:21,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,079 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:56:21,079 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 15:56:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:21,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:21,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:21,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,285 INFO L192 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 [2018-12-03 15:56:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:21,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:21,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:56:21,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:21,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:56:21,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:56:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:56:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:56:21,777 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 15:56:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,800 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:56:21,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:56:21,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:56:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,802 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:56:21,802 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:56:21,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:56:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:56:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:56:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:56:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:56:21,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:56:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,808 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:56:21,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:56:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:56:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:56:21,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,809 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:56:21,809 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 15:56:21,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:21,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:21,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:21,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,954 INFO L192 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 [2018-12-03 15:56:21,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:21,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:21,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:21,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:21,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:22,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:56:22,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:22,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:56:22,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:56:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:56:22,130 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 15:56:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:22,168 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:56:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:56:22,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:56:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:22,169 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:56:22,169 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:56:22,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:56:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:56:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:56:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:56:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:56:22,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:56:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:22,173 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:56:22,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:56:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:56:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:56:22,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:22,174 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:56:22,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:22,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 15:56:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,365 INFO L192 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 [2018-12-03 15:56:22,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:22,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:22,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:56:22,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:22,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:56:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:56:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:56:22,676 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 15:56:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:22,729 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:56:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:56:22,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:56:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:22,731 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:56:22,731 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:56:22,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:56:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:56:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:56:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:56:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:56:22,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:56:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:22,735 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:56:22,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:56:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:56:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:22,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:22,736 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:56:22,736 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:22,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 15:56:22,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,884 INFO L192 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 [2018-12-03 15:56:22,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:22,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:22,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:22,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:22,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:23,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:23,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:23,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:23,378 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 15:56:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,425 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:56:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:23,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,426 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:56:23,426 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:56:23,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:56:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:56:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:56:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:56:23,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:56:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,430 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:56:23,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:56:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:56:23,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,431 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:56:23,431 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 15:56:23,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:23,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:23,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:23,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,589 INFO L192 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 [2018-12-03 15:56:23,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:23,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:23,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:23,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:23,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:23,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:56:23,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:23,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:56:23,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:56:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:56:23,863 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 15:56:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,923 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:56:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:56:23,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:56:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,925 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:56:23,925 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:56:23,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:56:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:56:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:56:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:56:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:56:23,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:56:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,931 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:56:23,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:56:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:56:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:56:23,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,931 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:56:23,932 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 15:56:23,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,112 INFO L192 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 [2018-12-03 15:56:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:24,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:24,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:56:24,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:24,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:56:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:56:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:56:24,421 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 15:56:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:24,445 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:56:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:56:24,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 15:56:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:24,447 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:56:24,447 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:56:24,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:56:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:56:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:56:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:56:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:56:24,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:56:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:24,452 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:56:24,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:56:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:56:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:56:24,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:24,453 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:56:24,453 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:24,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 15:56:24,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:24,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:24,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,854 INFO L192 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 [2018-12-03 15:56:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:24,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:24,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:56:24,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:24,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:56:25,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:56:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:56:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:25,359 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 15:56:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,396 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:56:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:56:25,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 15:56:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,397 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:56:25,398 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:56:25,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:56:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:56:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:56:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:56:25,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:56:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:56:25,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:56:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:56:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:56:25,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,403 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:56:25,403 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 15:56:25,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:25,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:25,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,545 INFO L192 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 [2018-12-03 15:56:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:25,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:25,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:25,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:25,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:56:25,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:56:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:56:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:56:25,982 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 15:56:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:26,150 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:56:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:56:26,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 15:56:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:26,152 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:56:26,152 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:56:26,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:56:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:56:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:56:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:56:26,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:56:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:26,161 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:56:26,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:56:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:56:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:56:26,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:26,162 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:56:26,162 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:26,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 15:56:26,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:26,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:26,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:26,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:26,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:26,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,501 INFO L192 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 [2018-12-03 15:56:26,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:26,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:26,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:56:26,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:26,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:56:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:56:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:56:26,932 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 15:56:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:26,959 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:56:26,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:56:26,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 15:56:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:26,961 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:56:26,961 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:56:26,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:56:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:56:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:56:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:56:26,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:56:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:26,966 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:56:26,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:56:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:56:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:56:26,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:26,967 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:56:26,967 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:26,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 15:56:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:26,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:26,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:27,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:27,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:27,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,149 INFO L192 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 [2018-12-03 15:56:27,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:27,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:27,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:56:27,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:27,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:27,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:56:27,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:27,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:56:27,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:56:27,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:27,723 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 15:56:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:27,760 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:56:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:56:27,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 15:56:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:27,760 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:56:27,761 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:56:27,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:56:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:56:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:56:27,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:56:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:27,765 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:56:27,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:56:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:56:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:56:27,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:27,766 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:56:27,766 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:27,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:27,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 15:56:27,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:28,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:28,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:28,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,087 INFO L192 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 [2018-12-03 15:56:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:28,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:28,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:28,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:28,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:28,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:56:28,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:28,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:56:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:56:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:56:28,725 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 15:56:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:28,756 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:56:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:56:28,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 15:56:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:28,757 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:56:28,758 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:56:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:56:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:56:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:56:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:56:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:56:28,762 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:56:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:28,762 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:56:28,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:56:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:56:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:56:28,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:28,763 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:56:28,763 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:28,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 15:56:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:28,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:29,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:29,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:29,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:29,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:29,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:29,615 INFO L192 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 [2018-12-03 15:56:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:29,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:29,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:29,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:56:30,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:30,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:56:30,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:56:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:56:30,357 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 15:56:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:30,401 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:56:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:56:30,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 15:56:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:30,402 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:56:30,402 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:56:30,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:56:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:56:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:56:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:56:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:56:30,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:56:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:56:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:56:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:56:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:56:30,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:30,409 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:56:30,409 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:30,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 15:56:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:30,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:30,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:30,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,630 INFO L192 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 [2018-12-03 15:56:30,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:30,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:30,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:56:30,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:30,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:56:31,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:31,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:56:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:56:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:31,855 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 15:56:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:31,892 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:56:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:56:31,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 15:56:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:31,893 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:56:31,894 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:56:31,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:56:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:56:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:56:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:56:31,897 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:56:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:31,898 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:56:31,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:56:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:56:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:56:31,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:31,899 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:56:31,899 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:31,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 15:56:31,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:31,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:31,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:32,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:32,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:32,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,700 INFO L192 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 [2018-12-03 15:56:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:32,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:32,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:32,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:32,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:56:33,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:33,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:56:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:56:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:56:33,689 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 15:56:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:33,736 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:56:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:56:33,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 15:56:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:33,737 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:56:33,737 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:56:33,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:56:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:56:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:56:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:56:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:56:33,743 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:56:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:33,743 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:56:33,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:56:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:56:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:56:33,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:33,745 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:56:33,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:33,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 15:56:33,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:33,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:33,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:34,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:34,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:34,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,061 INFO L192 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 [2018-12-03 15:56:34,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:34,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:34,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:56:34,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:34,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:56:34,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:56:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:56:34,645 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 15:56:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:34,679 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:56:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:56:34,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 15:56:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:34,681 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:34,681 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:34,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:56:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:56:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:56:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:56:34,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:56:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:34,686 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:56:34,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:56:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:56:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:56:34,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:34,687 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:56:34,687 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:34,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 15:56:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:35,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:35,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:35,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,074 INFO L192 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 [2018-12-03 15:56:35,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:35,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:35,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:56:35,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:35,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:56:35,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:35,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:56:35,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:56:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:35,631 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 15:56:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:35,671 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:56:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:56:35,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 15:56:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:35,671 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:35,672 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:35,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:56:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:56:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:56:35,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:56:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:35,676 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:56:35,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:56:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:56:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:56:35,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:35,677 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:56:35,677 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:35,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 15:56:35,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:35,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:36,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:36,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:36,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:36,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:36,048 INFO L192 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 [2018-12-03 15:56:36,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:36,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:36,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:36,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:36,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:36,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:36,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:56:36,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:36,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:56:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:56:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:56:36,764 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 15:56:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:36,829 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:56:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:56:36,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 15:56:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:36,832 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:36,832 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:36,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:56:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:56:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:56:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:56:36,836 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:56:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:36,836 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:56:36,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:56:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:56:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:56:36,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:36,837 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:56:36,837 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 15:56:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:36,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:36,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:37,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:37,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:37,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:37,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:37,154 INFO L192 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 [2018-12-03 15:56:37,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:37,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:37,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:37,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:56:37,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:37,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:56:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:56:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:56:37,898 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 15:56:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:38,097 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:56:38,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:56:38,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 15:56:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:38,099 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:38,099 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:56:38,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:56:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:56:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:56:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:56:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:56:38,103 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:56:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:38,104 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:56:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:56:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:56:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:56:38,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:38,105 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:56:38,105 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 15:56:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:38,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:38,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:38,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,711 INFO L192 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 [2018-12-03 15:56:38,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:38,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:38,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:56:38,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:38,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:39,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:39,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:56:39,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:39,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:56:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:56:39,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:56:39,541 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 15:56:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:39,583 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:56:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:56:39,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 15:56:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:39,584 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:56:39,584 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:39,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:56:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:56:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:56:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:56:39,589 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:56:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:39,589 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:56:39,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:56:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:56:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:56:39,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:39,590 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:56:39,590 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:39,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 15:56:39,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:39,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:39,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:40,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:40,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:40,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:40,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:40,535 INFO L192 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 [2018-12-03 15:56:40,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:40,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:40,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:40,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:40,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:41,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:56:41,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:41,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:56:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:56:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:56:41,274 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 15:56:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:41,325 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:56:41,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:56:41,326 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 15:56:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:41,326 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:41,327 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:56:41,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:56:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:56:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:56:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:56:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:56:41,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:56:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:41,333 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:56:41,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:56:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:56:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:56:41,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:41,334 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:56:41,334 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:41,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 15:56:41,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:41,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:41,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:41,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:41,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:41,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,636 INFO L192 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 [2018-12-03 15:56:41,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:41,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:56:42,955 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:42,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:56:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:56:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:56:42,957 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 15:56:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:42,994 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:56:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:56:42,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 15:56:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:42,995 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:42,995 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:42,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:56:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:56:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:56:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:56:42,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:56:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:42,999 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:56:42,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:56:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:56:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:56:43,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:43,000 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:56:43,000 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:43,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 15:56:43,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:43,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:43,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:43,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:43,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:43,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:43,396 INFO L192 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 [2018-12-03 15:56:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:43,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:43,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:56:43,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:43,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:43,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:44,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:44,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:56:44,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:44,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:56:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:56:44,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:56:44,570 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 15:56:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:44,720 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:56:44,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:56:44,720 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 15:56:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:44,721 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:56:44,721 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:56:44,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:56:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:56:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:56:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:56:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:56:44,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:56:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:44,726 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:56:44,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:56:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:56:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:56:44,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:44,726 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:56:44,727 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:44,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 15:56:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:44,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:44,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:44,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:45,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:45,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:45,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:45,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:45,350 INFO L192 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 [2018-12-03 15:56:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:45,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:45,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:45,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:45,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:46,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:56:46,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:46,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:56:46,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:56:46,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:56:46,260 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 15:56:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:46,300 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:56:46,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:56:46,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 15:56:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:46,301 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:46,301 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:46,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:56:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:56:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:56:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:56:46,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:56:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:46,307 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:56:46,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:56:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:56:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:56:46,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:46,308 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:56:46,308 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:46,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 15:56:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:46,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:46,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:46,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:46,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:46,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:46,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:46,681 INFO L192 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 [2018-12-03 15:56:46,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:46,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:46,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:47,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:56:47,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:47,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:56:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:56:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:56:47,676 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 15:56:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:47,758 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:56:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:56:47,759 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 15:56:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:47,759 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:56:47,759 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:56:47,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:56:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:56:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:56:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:56:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:56:47,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:56:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:47,763 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:56:47,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:56:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:56:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:56:47,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:47,764 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:56:47,765 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:47,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 15:56:47,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:47,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:48,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:48,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:48,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:48,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:48,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:48,147 INFO L192 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 [2018-12-03 15:56:48,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:48,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:48,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:56:48,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:48,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:48,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:56:49,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:49,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:56:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:56:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:56:49,757 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 15:56:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:49,806 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:56:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:56:49,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 15:56:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:49,807 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:56:49,807 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:56:49,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:56:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:56:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:56:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:56:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:56:49,812 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:56:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:49,812 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:56:49,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:56:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:56:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:56:49,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:49,813 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:56:49,813 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:49,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 15:56:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:49,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:50,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:50,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:50,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,279 INFO L192 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 [2018-12-03 15:56:50,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:50,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:50,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:50,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:50,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:56:51,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:51,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:56:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:56:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:56:51,373 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 15:56:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:51,426 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:56:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:56:51,426 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 15:56:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:51,427 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:56:51,427 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:56:51,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:56:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:56:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:56:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:56:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:56:51,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 15:56:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:51,432 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:56:51,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:56:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:56:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:56:51,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:51,433 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:56:51,433 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:51,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 15:56:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:51,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:51,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:51,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:51,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:51,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:51,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:51,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:51,855 INFO L192 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 [2018-12-03 15:56:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:51,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:51,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:51,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:53,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:56:53,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:53,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:56:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:56:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:56:53,059 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 15:56:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:53,112 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:56:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:56:53,113 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 15:56:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:53,114 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:56:53,114 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:56:53,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:56:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:56:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:56:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:56:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:56:53,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 15:56:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:53,118 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:56:53,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:56:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:56:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:56:53,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:53,119 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 15:56:53,119 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:53,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 15:56:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:53,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:53,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:53,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:53,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:53,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,644 INFO L192 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 [2018-12-03 15:56:53,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:53,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:53,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:56:53,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:53,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:55,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 15:56:55,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:55,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:56:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:56:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:56:55,206 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 15:56:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:55,293 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 15:56:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:56:55,293 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 15:56:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:55,294 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:56:55,294 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:56:55,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:56:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:56:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:56:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:56:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 15:56:55,298 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 15:56:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:55,298 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 15:56:55,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:56:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 15:56:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:56:55,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:55,299 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 15:56:55,299 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:55,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 15:56:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:55,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:55,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:55,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:55,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:55,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:55,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:55,897 INFO L192 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 [2018-12-03 15:56:55,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:55,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:55,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:55,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:55,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:56:57,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:57,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:56:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:56:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:56:57,251 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 15:56:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:57,341 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 15:56:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:56:57,341 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 15:56:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:57,342 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:56:57,342 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:56:57,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:56:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:56:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:56:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:56:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:56:57,346 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 15:56:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:57,347 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:56:57,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:56:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:56:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:56:57,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:57,347 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 15:56:57,347 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:57,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 15:56:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:57,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:57,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:57,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:57,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:57,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:57,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:57,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:57,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:57,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:57,957 INFO L192 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 [2018-12-03 15:56:57,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:57,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:57,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:57,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:59,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:56:59,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:59,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:56:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:56:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:56:59,906 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 15:56:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:59,980 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:56:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:56:59,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 15:56:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:59,981 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:56:59,981 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:56:59,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:56:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:56:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:56:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:56:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 15:56:59,985 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 15:56:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:59,985 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 15:56:59,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:56:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 15:56:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:56:59,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:59,986 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 15:56:59,986 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:59,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 15:56:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:59,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:59,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:59,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:00,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:00,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:00,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:00,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:00,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:00,512 INFO L192 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 [2018-12-03 15:57:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:00,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:00,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:57:00,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:00,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:00,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:57:01,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:01,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:57:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:57:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:57:01,980 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 15:57:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:02,039 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 15:57:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:57:02,039 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 15:57:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:02,040 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:57:02,040 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:57:02,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:57:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:57:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:57:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:57:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:57:02,043 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 15:57:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:02,044 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:57:02,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:57:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:57:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:57:02,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:02,044 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 15:57:02,044 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:02,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:02,045 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 15:57:02,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:02,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:02,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:02,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:02,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:02,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:02,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:02,792 INFO L192 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 [2018-12-03 15:57:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:02,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:02,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:02,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:02,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:05,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:57:05,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:05,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:57:05,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:57:05,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:57:05,038 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 15:57:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:05,095 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 15:57:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:57:05,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 15:57:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:05,096 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:57:05,097 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:57:05,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:57:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:57:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:57:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:57:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 15:57:05,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 15:57:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:05,099 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 15:57:05,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:57:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 15:57:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:57:05,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:05,100 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 15:57:05,100 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:05,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 15:57:05,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:05,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:05,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,735 INFO L192 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 [2018-12-03 15:57:05,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:05,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:05,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:07,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:07,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:57:07,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:07,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:57:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:57:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:57:07,297 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 15:57:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:07,361 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 15:57:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:57:07,361 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 15:57:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:07,362 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:57:07,362 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:57:07,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:57:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:57:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:57:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:57:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:57:07,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 15:57:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:07,365 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:57:07,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:57:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:57:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:57:07,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:07,366 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 15:57:07,367 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:07,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 15:57:07,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:07,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:07,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:07,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:07,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:08,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:08,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:08,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:08,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:08,213 INFO L192 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 [2018-12-03 15:57:08,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:08,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:08,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:57:08,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:08,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:10,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 15:57:10,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:10,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:57:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:57:10,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:57:10,315 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 15:57:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:10,379 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:57:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:57:10,380 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 15:57:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:10,381 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:57:10,381 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:57:10,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:57:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:57:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:57:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:57:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 15:57:10,384 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 15:57:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:10,385 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 15:57:10,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:57:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 15:57:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:57:10,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:10,385 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 15:57:10,386 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 15:57:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:10,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:10,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:11,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:11,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:11,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:11,083 INFO L192 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 [2018-12-03 15:57:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:11,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:11,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:11,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:11,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:11,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:57:12,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:12,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:57:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:57:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:57:12,839 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 15:57:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:12,886 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 15:57:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:57:12,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 15:57:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:12,887 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:57:12,887 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:57:12,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:57:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:57:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:57:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:57:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:57:12,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 15:57:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:12,890 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:57:12,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:57:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:57:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:57:12,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:12,891 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 15:57:12,891 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 15:57:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:12,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:12,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:13,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:13,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:13,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,662 INFO L192 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 [2018-12-03 15:57:13,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:13,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:13,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:15,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:57:15,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:15,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:57:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:57:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:57:15,777 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 15:57:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:15,867 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 15:57:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:57:15,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 15:57:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:15,868 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:57:15,868 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:57:15,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:57:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:57:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:57:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:57:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 15:57:15,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 15:57:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:15,872 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 15:57:15,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:57:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 15:57:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:57:15,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:15,872 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 15:57:15,873 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:15,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 15:57:15,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:15,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:15,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:15,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:15,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:16,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:16,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:16,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:16,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:16,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:16,582 INFO L192 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 [2018-12-03 15:57:16,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:16,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:16,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:57:16,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:16,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:16,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:18,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:18,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:57:18,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:18,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:57:18,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:57:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:57:18,556 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 15:57:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:18,626 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 15:57:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:57:18,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 15:57:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:18,628 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:57:18,628 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:57:18,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:57:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:57:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:57:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:57:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:57:18,631 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 15:57:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:18,631 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:57:18,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:57:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:57:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:57:18,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:18,632 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 15:57:18,632 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:18,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 15:57:18,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:18,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:18,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:19,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:19,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:19,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:19,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:19,826 INFO L192 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 [2018-12-03 15:57:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:19,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:19,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:19,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:19,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:57:22,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:22,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:57:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:57:22,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:57:22,088 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 15:57:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:22,139 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:57:22,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:57:22,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 15:57:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:22,140 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:57:22,140 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:57:22,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:57:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:57:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:57:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:57:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 15:57:22,144 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 15:57:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:22,144 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 15:57:22,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:57:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 15:57:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:57:22,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:22,145 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 15:57:22,145 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:22,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 15:57:22,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:22,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:22,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:22,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:22,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:22,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:22,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:22,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:22,973 INFO L192 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 [2018-12-03 15:57:22,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:22,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:23,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:25,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:25,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:57:25,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:25,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:57:25,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:57:25,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:57:25,380 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 15:57:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:25,530 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 15:57:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:57:25,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 15:57:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:25,531 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:57:25,531 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:57:25,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:57:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:57:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:57:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:57:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:57:25,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 15:57:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:25,535 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:57:25,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:57:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:57:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:57:25,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:25,536 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 15:57:25,536 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:25,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 15:57:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:25,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:26,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:26,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:26,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:26,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:26,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:26,356 INFO L192 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 [2018-12-03 15:57:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:26,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:26,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:57:26,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:26,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:26,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:28,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 15:57:28,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:57:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:57:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:57:28,533 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 15:57:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:28,590 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 15:57:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:57:28,590 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 15:57:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:28,591 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:57:28,591 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:57:28,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:57:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:57:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:57:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:57:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 15:57:28,594 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 15:57:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:28,594 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 15:57:28,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:57:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 15:57:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:57:28,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:28,595 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 15:57:28,595 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:28,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 15:57:28,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:28,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:28,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:28,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:28,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:29,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:29,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:29,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:29,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:29,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:29,455 INFO L192 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 [2018-12-03 15:57:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:29,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:29,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:29,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:29,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:29,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:32,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:57:32,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:32,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:57:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:57:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:57:32,204 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 15:57:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,519 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 15:57:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:57:32,520 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 15:57:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,520 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:57:32,520 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:57:32,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:57:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:57:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:57:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:57:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:57:32,522 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 15:57:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,523 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:57:32,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:57:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:57:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:57:32,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,525 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 15:57:32,525 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 15:57:32,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,504 INFO L192 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 [2018-12-03 15:57:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:33,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:36,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:57:36,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:36,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:57:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:57:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:57:36,297 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 15:57:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:36,387 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:57:36,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:57:36,388 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 15:57:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:36,388 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:57:36,389 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:57:36,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:57:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:57:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:57:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:57:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 15:57:36,392 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 15:57:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:36,392 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 15:57:36,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:57:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 15:57:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:57:36,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:36,393 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 15:57:36,393 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:36,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 15:57:36,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:37,703 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:37,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:37,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,704 INFO L192 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 [2018-12-03 15:57:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:37,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:37,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:57:37,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:37,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:40,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:57:40,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:40,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:57:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:57:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:57:40,521 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 15:57:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:40,599 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 15:57:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:57:40,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 15:57:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:40,605 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:57:40,606 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:57:40,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:57:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:57:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:57:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:57:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:57:40,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 15:57:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:40,610 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:57:40,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:57:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:57:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:57:40,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:40,611 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 15:57:40,611 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 15:57:40,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:41,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:41,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:41,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,535 INFO L192 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 [2018-12-03 15:57:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:41,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:41,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:41,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:41,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:44,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:57:44,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:44,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:57:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:57:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:57:44,222 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 15:57:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:44,360 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 15:57:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:57:44,361 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 15:57:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:44,362 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:57:44,362 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:57:44,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:57:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:57:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:57:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:57:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 15:57:44,366 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 15:57:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:44,366 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 15:57:44,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:57:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 15:57:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:57:44,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:44,367 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 15:57:44,367 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:44,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 15:57:44,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:46,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:46,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:46,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,370 INFO L192 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 [2018-12-03 15:57:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:46,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:46,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:57:49,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:49,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:57:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:57:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:49,221 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 15:57:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:49,302 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 15:57:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:57:49,303 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 15:57:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:49,303 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:57:49,304 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:57:49,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:57:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:57:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:57:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:57:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:57:49,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 15:57:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:49,307 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:57:49,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:57:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:57:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:57:49,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:49,308 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 15:57:49,308 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:49,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 15:57:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:50,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:50,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:50,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,670 INFO L192 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 [2018-12-03 15:57:50,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:50,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:50,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:57:50,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:50,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 15:57:53,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:53,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:57:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:57:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:57:53,646 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 15:57:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:53,821 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 15:57:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:57:53,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 15:57:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:53,823 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:57:53,823 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:57:53,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:57:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:57:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:57:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:57:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 15:57:53,826 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 15:57:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:53,826 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 15:57:53,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:57:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 15:57:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:57:53,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:53,826 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 15:57:53,827 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:53,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-12-03 15:57:53,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:54,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:54,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:54,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,896 INFO L192 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 [2018-12-03 15:57:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:54,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:54,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:54,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:54,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:57:58,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:57:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:57:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:57:58,333 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 15:57:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:58,412 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 15:57:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:57:58,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 15:57:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:58,413 INFO L225 Difference]: With dead ends: 58 [2018-12-03 15:57:58,413 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:57:58,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:57:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:57:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:57:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:57:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 15:57:58,417 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 15:57:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:58,417 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 15:57:58,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:57:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 15:57:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:57:58,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:58,418 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 15:57:58,418 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:58,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-12-03 15:57:58,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:59,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:59,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:59,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,447 INFO L192 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 [2018-12-03 15:57:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:59,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:59,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:02,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:58:02,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:02,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:58:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:58:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:58:02,804 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 15:58:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:02,888 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 15:58:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:58:02,888 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 15:58:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:02,889 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:58:02,889 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:58:02,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:58:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:58:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:58:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:58:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 15:58:02,894 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 15:58:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:02,894 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 15:58:02,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:58:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 15:58:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:58:02,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:02,895 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 15:58:02,895 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:02,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-12-03 15:58:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:02,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:03,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:03,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:03,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:03,971 INFO L192 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 [2018-12-03 15:58:03,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:03,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:04,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:58:04,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:04,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:07,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:58:07,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:07,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:58:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:58:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:58:07,194 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 15:58:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:07,279 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 15:58:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:58:07,279 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 15:58:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:07,280 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:58:07,281 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:58:07,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:58:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:58:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:58:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:58:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 15:58:07,284 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 15:58:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:07,285 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 15:58:07,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:58:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 15:58:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:58:07,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:07,285 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 15:58:07,285 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:07,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-12-03 15:58:07,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:07,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:07,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:08,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:08,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:08,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,465 INFO L192 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 [2018-12-03 15:58:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:08,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:08,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:08,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:08,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:12,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:58:12,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:12,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:58:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:58:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:58:12,013 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 15:58:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:12,088 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 15:58:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:58:12,088 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 15:58:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:12,089 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:58:12,089 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:58:12,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:58:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:58:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:58:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:58:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 15:58:12,092 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 15:58:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:12,092 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 15:58:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:58:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 15:58:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:58:12,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:12,093 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 15:58:12,093 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-12-03 15:58:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:13,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:13,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:13,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:13,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:13,229 INFO L192 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 [2018-12-03 15:58:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:13,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:13,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:16,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:58:16,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:16,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:58:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:58:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:58:16,849 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 15:58:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:16,960 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 15:58:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:58:16,961 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 15:58:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:16,962 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:58:16,962 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:58:16,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:58:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:58:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:58:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:58:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 15:58:16,966 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 15:58:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:16,966 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 15:58:16,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:58:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 15:58:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:58:16,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:16,966 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 15:58:16,967 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:16,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-12-03 15:58:16,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:18,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:18,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:18,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,166 INFO L192 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 [2018-12-03 15:58:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:18,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:18,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:58:18,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:18,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:21,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:21,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 15:58:21,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:21,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:58:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:58:21,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:58:21,871 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 15:58:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:21,965 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 15:58:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:58:21,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 15:58:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:21,967 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:58:21,967 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:58:21,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:58:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:58:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:58:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:58:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 15:58:21,971 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 15:58:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:21,971 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 15:58:21,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:58:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 15:58:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:58:21,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:21,972 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 15:58:21,972 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:21,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-12-03 15:58:21,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:23,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:23,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:23,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,409 INFO L192 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 [2018-12-03 15:58:23,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:23,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:23,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:23,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:23,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:58:27,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:27,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:58:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:58:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:58:27,193 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 15:58:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:27,284 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 15:58:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:58:27,284 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 15:58:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:27,285 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:58:27,285 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:58:27,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:58:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:58:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:58:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:58:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 15:58:27,289 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 15:58:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:27,289 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 15:58:27,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:58:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 15:58:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:58:27,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:27,290 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 15:58:27,290 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:27,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-12-03 15:58:27,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:27,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:28,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:28,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:28,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:28,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:28,802 INFO L192 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 [2018-12-03 15:58:28,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:28,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:28,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:58:32,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:32,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:58:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:58:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:58:32,911 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 15:58:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:33,005 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 15:58:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:58:33,005 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 15:58:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:33,006 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:58:33,006 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:58:33,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:58:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:58:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:58:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:58:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 15:58:33,010 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 15:58:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:33,010 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 15:58:33,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:58:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 15:58:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:58:33,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:33,010 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 15:58:33,011 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:33,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-12-03 15:58:33,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:33,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:33,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:36,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:36,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:36,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:36,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:36,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:36,618 INFO L192 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 [2018-12-03 15:58:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:36,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:36,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:58:36,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:36,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:36,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:58:40,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:40,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:58:40,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:58:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:58:40,615 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 15:58:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:40,711 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 15:58:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:58:40,712 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 15:58:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:40,713 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:58:40,713 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:58:40,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:58:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:58:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:58:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:58:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 15:58:40,716 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 15:58:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:40,716 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 15:58:40,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:58:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 15:58:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:58:40,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:40,717 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 15:58:40,717 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:40,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-12-03 15:58:40,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:42,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:42,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:42,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,832 INFO L192 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 [2018-12-03 15:58:42,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:42,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:42,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:42,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:42,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:47,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:47,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:58:47,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:47,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:58:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:58:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:58:47,115 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 15:58:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:47,215 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 15:58:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:58:47,216 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 15:58:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:47,216 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:58:47,217 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:58:47,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:58:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:58:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 15:58:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:58:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 15:58:47,221 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 15:58:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:47,221 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 15:58:47,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:58:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 15:58:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:58:47,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:47,221 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 15:58:47,221 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:47,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-12-03 15:58:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:48,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:48,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:48,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:48,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:48,649 INFO L192 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 [2018-12-03 15:58:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:48,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:48,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:52,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:52,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:58:52,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:52,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:58:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:58:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:58:52,873 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 15:58:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:52,988 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 15:58:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:58:52,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 15:58:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:52,990 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:58:52,990 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:58:52,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:58:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:58:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:58:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:58:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 15:58:52,993 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 15:58:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:52,994 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 15:58:52,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:58:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 15:58:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:58:52,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:52,995 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 15:58:52,995 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:52,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-12-03 15:58:52,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:52,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:52,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:54,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:54,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:54,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:54,397 INFO L192 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 [2018-12-03 15:58:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:54,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:54,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:58:54,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:54,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:54,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:58,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:58:58,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:58,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:58:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:58:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:58:58,913 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 15:58:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:59,075 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 15:58:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:58:59,075 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 15:58:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:59,076 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:58:59,076 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:58:59,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:58:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:58:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:58:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:58:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 15:58:59,080 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 15:58:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:59,080 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 15:58:59,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:58:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 15:58:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:58:59,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:59,081 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 15:58:59,081 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:59,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-12-03 15:58:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:00,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:00,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:00,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:00,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:00,610 INFO L192 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 [2018-12-03 15:59:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:00,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:00,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:00,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:00,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:59:05,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:05,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:59:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:59:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:59:05,216 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 15:59:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:05,316 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 15:59:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:59:05,317 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 15:59:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:05,318 INFO L225 Difference]: With dead ends: 70 [2018-12-03 15:59:05,318 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:59:05,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:59:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:59:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:59:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:59:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 15:59:05,321 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 15:59:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:05,322 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 15:59:05,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:59:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 15:59:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:59:05,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:05,322 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 15:59:05,323 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:05,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-12-03 15:59:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:05,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:05,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:06,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:06,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:06,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,834 INFO L192 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 [2018-12-03 15:59:06,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:06,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:11,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:59:11,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:11,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:59:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:59:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:59:11,499 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 15:59:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:11,767 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 15:59:11,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:59:11,767 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 15:59:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:11,768 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:59:11,768 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:59:11,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:59:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:59:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:59:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:59:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 15:59:11,772 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 15:59:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 15:59:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:59:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 15:59:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:59:11,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:11,773 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 15:59:11,773 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:11,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-12-03 15:59:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:14,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:14,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:14,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:14,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:14,257 INFO L192 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 [2018-12-03 15:59:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:14,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:14,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:59:14,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:14,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:19,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:59:19,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:19,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:59:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:59:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:59:19,105 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 15:59:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:19,227 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 15:59:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:59:19,227 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 15:59:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:19,228 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:59:19,228 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:59:19,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:59:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:59:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:59:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:59:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 15:59:19,232 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 15:59:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:19,232 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 15:59:19,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:59:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 15:59:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:59:19,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:19,233 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 15:59:19,233 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:19,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-12-03 15:59:19,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:20,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:20,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:20,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:20,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:20,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:20,810 INFO L192 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 [2018-12-03 15:59:20,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:20,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:20,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:20,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:20,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:20,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:26,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:59:26,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:26,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:59:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:59:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:59:26,859 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 15:59:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:26,950 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 15:59:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:59:26,950 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 15:59:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:26,951 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:59:26,951 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:59:26,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:59:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:59:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:59:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:59:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 15:59:26,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 15:59:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:26,955 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 15:59:26,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:59:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 15:59:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:59:26,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:26,956 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 15:59:26,956 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:26,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-12-03 15:59:26,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:26,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:26,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:28,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:28,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:28,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:28,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:28,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:28,911 INFO L192 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 [2018-12-03 15:59:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:28,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:28,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:28,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:34,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:59:34,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:34,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:59:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:59:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:59:34,012 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 15:59:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:34,135 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 15:59:34,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:59:34,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 15:59:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:34,136 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:59:34,136 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:59:34,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:59:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:59:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:59:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:59:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 15:59:34,140 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 15:59:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:34,141 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 15:59:34,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:59:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 15:59:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:59:34,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:34,141 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 15:59:34,142 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:34,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-12-03 15:59:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:34,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:35,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:35,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:35,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,887 INFO L192 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 [2018-12-03 15:59:35,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:35,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:35,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:59:35,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:35,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:41,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 15:59:41,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:41,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:59:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:59:41,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:59:41,181 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 15:59:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:41,274 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 15:59:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:59:41,275 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 15:59:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:41,275 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:59:41,276 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:59:41,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:59:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:59:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:59:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:59:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 15:59:41,279 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 15:59:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:41,279 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 15:59:41,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:59:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 15:59:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:59:41,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:41,280 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 15:59:41,280 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:41,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-12-03 15:59:41,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:43,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:43,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:43,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,278 INFO L192 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 [2018-12-03 15:59:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:43,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:43,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:43,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:43,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:48,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:59:48,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:59:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:59:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:59:48,754 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 15:59:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:48,887 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 15:59:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:59:48,887 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 15:59:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:48,888 INFO L225 Difference]: With dead ends: 76 [2018-12-03 15:59:48,888 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:59:48,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:59:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:59:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:59:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:59:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 15:59:48,893 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 15:59:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:48,893 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 15:59:48,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:59:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 15:59:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:59:48,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:48,894 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 15:59:48,894 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:48,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-12-03 15:59:48,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:48,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:48,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:51,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:51,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:51,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,749 INFO L192 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 [2018-12-03 15:59:51,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:51,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:51,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:57,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:59:57,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:57,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:59:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:59:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:59:57,312 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 15:59:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:57,548 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 15:59:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:59:57,548 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 15:59:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:57,549 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:59:57,549 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:59:57,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:59:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:59:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:59:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:59:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 15:59:57,554 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 15:59:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:57,554 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 15:59:57,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:59:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 15:59:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:59:57,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:57,555 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 15:59:57,555 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:57,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-12-03 15:59:57,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:00,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:00,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:00,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,062 INFO L192 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 [2018-12-03 16:00:00,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:00,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:00,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:00:00,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:00,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:05,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:00:05,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:05,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:00:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:00:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:00:05,800 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 16:00:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:05,933 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 16:00:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:00:05,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 16:00:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:05,934 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:00:05,934 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:00:05,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:00:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:00:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:00:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:00:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:00:05,939 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 16:00:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:05,939 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:00:05,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:00:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:00:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:00:05,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:05,940 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 16:00:05,940 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:05,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:05,941 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-12-03 16:00:05,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:05,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:05,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:05,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:07,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:07,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:07,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,955 INFO L192 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 [2018-12-03 16:00:07,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:07,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:08,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:08,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:08,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:08,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:14,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:14,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:00:14,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:14,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:00:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:00:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:00:14,208 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 16:00:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:14,330 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:00:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:00:14,330 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 16:00:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:14,331 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:00:14,331 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:00:14,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:00:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:00:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:00:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:00:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 16:00:14,336 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 16:00:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:14,336 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 16:00:14,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:00:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 16:00:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:00:14,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:14,337 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 16:00:14,338 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:14,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-12-03 16:00:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:14,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:14,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:16,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:16,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:16,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:16,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:16,307 INFO L192 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 [2018-12-03 16:00:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:16,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:16,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:16,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:22,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:22,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:00:22,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:22,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:00:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:00:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:00:22,347 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 16:00:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:22,460 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 16:00:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:00:22,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 16:00:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:22,462 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:00:22,462 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:00:22,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:00:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:00:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:00:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:00:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:00:22,466 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 16:00:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:22,466 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:00:22,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:00:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:00:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:00:22,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:22,467 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 16:00:22,467 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:22,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-12-03 16:00:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:22,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:22,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:24,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:24,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:24,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:24,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:24,830 INFO L192 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 [2018-12-03 16:00:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:24,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:24,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:00:24,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:24,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:30,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:30,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:00:30,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:30,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:00:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:00:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:00:30,932 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 16:00:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:31,041 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:00:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:00:31,042 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 16:00:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:31,043 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:00:31,043 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:00:31,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:00:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:00:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:00:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:00:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:00:31,047 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 16:00:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:31,047 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:00:31,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:00:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:00:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:00:31,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:31,048 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 16:00:31,048 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:31,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-12-03 16:00:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:31,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:31,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:33,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:33,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:33,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:33,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:33,122 INFO L192 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 [2018-12-03 16:00:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:33,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:33,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:33,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:33,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:00:39,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:39,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:00:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:00:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:00:39,648 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 16:00:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:39,793 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 16:00:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:00:39,793 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 16:00:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:39,794 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:00:39,794 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:00:39,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:00:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:00:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:00:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:00:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:00:39,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 16:00:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:00:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:00:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:00:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:00:39,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:39,799 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 16:00:39,800 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-12-03 16:00:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:39,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:39,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:41,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:41,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:41,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:41,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,969 INFO L192 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 [2018-12-03 16:00:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:41,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:42,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:42,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:48,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:48,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:00:48,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:48,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:00:48,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:00:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:00:48,399 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 16:00:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:49,320 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:00:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:00:49,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 16:00:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:49,322 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:00:49,322 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:00:49,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:00:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:00:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:00:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:00:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 16:00:49,325 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 16:00:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:49,326 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 16:00:49,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:00:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 16:00:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:00:49,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:49,327 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 16:00:49,327 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:49,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-12-03 16:00:49,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:49,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:49,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:49,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:49,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:51,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:51,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:51,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:51,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:51,651 INFO L192 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 [2018-12-03 16:00:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:51,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:51,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:00:51,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:51,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:51,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:00:58,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:58,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:00:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:00:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:00:58,480 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 16:00:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:58,580 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 16:00:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:00:58,581 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 16:00:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:58,581 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:00:58,582 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:00:58,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:00:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:00:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:00:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:00:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:00:58,586 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 16:00:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:58,586 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:00:58,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:00:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:00:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:00:58,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:58,587 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 16:00:58,587 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-12-03 16:00:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:58,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:58,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:01,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:01,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,146 INFO L192 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 [2018-12-03 16:01:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:01,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:01,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:01,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:01,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:07,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:01:07,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:07,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:01:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:01:07,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:01:07,876 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 16:01:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:08,042 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:01:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:01:08,042 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 16:01:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:08,043 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:01:08,043 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:01:08,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:01:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:01:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:01:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:01:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 16:01:08,048 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 16:01:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:08,048 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 16:01:08,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:01:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 16:01:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:01:08,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:08,049 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 16:01:08,049 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-12-03 16:01:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:08,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:08,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:10,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:10,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:10,668 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:10,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:10,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:10,668 INFO L192 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 [2018-12-03 16:01:10,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:10,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:10,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:10,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:17,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:01:17,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:17,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:01:17,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:01:17,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:01:17,705 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 16:01:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:17,817 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 16:01:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:01:17,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 16:01:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:17,819 INFO L225 Difference]: With dead ends: 86 [2018-12-03 16:01:17,819 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:01:17,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:01:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:01:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:01:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:01:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:01:17,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 16:01:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:17,823 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:01:17,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:01:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:01:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:01:17,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:17,823 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 16:01:17,824 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:17,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-12-03 16:01:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:20,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:20,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:20,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:20,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:20,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:20,551 INFO L192 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 [2018-12-03 16:01:20,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:20,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:20,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:01:20,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:20,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:20,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:28,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:01:28,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:28,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:01:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:01:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:01:28,268 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 16:01:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:28,822 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:01:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:01:28,822 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 16:01:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:28,823 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:01:28,823 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:01:28,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:01:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:01:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:01:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:01:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 16:01:28,826 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 16:01:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:28,826 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 16:01:28,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:01:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 16:01:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:01:28,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:28,827 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 16:01:28,827 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:28,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-12-03 16:01:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:28,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:28,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:31,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:31,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:31,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:31,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:31,603 INFO L192 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 [2018-12-03 16:01:31,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:31,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:31,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:31,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:31,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:31,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:39,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:39,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:01:39,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:39,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:01:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:01:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:01:39,053 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 16:01:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:39,234 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 16:01:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:01:39,235 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 16:01:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:39,235 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:01:39,235 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:01:39,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:01:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:01:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:01:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:01:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:01:39,239 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 16:01:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:39,240 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:01:39,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:01:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:01:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:01:39,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:39,241 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 16:01:39,241 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:39,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-12-03 16:01:39,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:39,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:39,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:42,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:42,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:42,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:42,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:42,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:42,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:49,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:49,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:01:49,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:49,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:01:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:01:49,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:01:49,959 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 16:01:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:50,113 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:01:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:01:50,113 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 16:01:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:50,114 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:01:50,114 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:01:50,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:01:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:01:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:01:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:01:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 16:01:50,118 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 16:01:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:50,118 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 16:01:50,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:01:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 16:01:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:01:50,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:50,119 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 16:01:50,119 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:50,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-12-03 16:01:50,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:50,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:50,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:52,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:52,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:52,964 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:52,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:52,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:52,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:52,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:52,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:53,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:01:53,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:53,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:53,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:00,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:00,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:02:00,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:00,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:02:00,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:02:00,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:02:00,482 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 16:02:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:00,756 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 16:02:00,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:02:00,757 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 16:02:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:00,757 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:02:00,758 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:02:00,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:02:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:02:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:02:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:02:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:02:00,762 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 16:02:00,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:00,762 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:02:00,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:02:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:02:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:02:00,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:00,763 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 16:02:00,763 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:00,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-12-03 16:02:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:00,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:00,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:03,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:03,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:03,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:03,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:03,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:03,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:03,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:03,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:03,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:03,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:03,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:03,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:11,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:02:11,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:11,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:02:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:02:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:02:11,325 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 16:02:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:11,532 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:02:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:02:11,533 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 16:02:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:11,534 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:02:11,534 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:02:11,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:02:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:02:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:02:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:02:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 16:02:11,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 16:02:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:11,539 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 16:02:11,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:02:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 16:02:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:02:11,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:11,540 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 16:02:11,540 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:11,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-12-03 16:02:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:11,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:11,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:14,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:14,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:14,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:14,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:14,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:14,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:14,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:14,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:14,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:21,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:21,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:02:21,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:21,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:02:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:02:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:02:21,953 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 16:02:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:22,147 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 16:02:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:02:22,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 16:02:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:22,148 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:02:22,149 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:02:22,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:02:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:02:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:02:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:02:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:02:22,152 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 16:02:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:02:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:02:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:02:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:02:22,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:22,153 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 16:02:22,153 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:22,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-12-03 16:02:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:22,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:24,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:24,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:24,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:24,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:24,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:24,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:24,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:24,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:02:24,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:24,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:24,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:32,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:32,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:02:32,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:32,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:02:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:02:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:02:32,701 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 16:02:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:32,891 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:02:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:02:32,892 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 16:02:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:32,893 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:02:32,893 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:02:32,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:02:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:02:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:02:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:02:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 16:02:32,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 16:02:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:32,897 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 16:02:32,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:02:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 16:02:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:02:32,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:32,897 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 16:02:32,898 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:32,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-12-03 16:02:32,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:32,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:32,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:35,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:35,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:35,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:35,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:35,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:35,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:35,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:35,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:35,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:35,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:35,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:35,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:43,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:43,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:02:43,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:43,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:02:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:02:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:02:43,903 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 16:02:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:44,031 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 16:02:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:02:44,031 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 16:02:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:44,032 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:02:44,032 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:02:44,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:02:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:02:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:02:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:02:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:02:44,036 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 16:02:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:44,036 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:02:44,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:02:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:02:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:02:44,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:44,037 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 16:02:44,037 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:44,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-12-03 16:02:44,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:44,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:44,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:46,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:46,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:46,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:46,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:46,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:46,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:46,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:46,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:46,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:54,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:02:54,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:54,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:02:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:02:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:02:55,000 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 16:02:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:55,192 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:02:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:02:55,192 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 16:02:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:55,193 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:02:55,193 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:02:55,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:02:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:02:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:02:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:02:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 16:02:55,197 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 16:02:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:55,198 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 16:02:55,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:02:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 16:02:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:02:55,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:55,198 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 16:02:55,199 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:55,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-12-03 16:02:55,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:55,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:55,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:55,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:55,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:58,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:58,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:58,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:58,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:58,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:58,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:58,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:58,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:02:58,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:58,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:58,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:06,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:06,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:03:06,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:06,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:03:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:03:06,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:03:06,606 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 16:03:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:06,745 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 16:03:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:03:06,745 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 16:03:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:06,746 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:03:06,746 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:03:06,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:03:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:03:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:03:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:03:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:03:06,750 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 16:03:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:06,751 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:03:06,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:03:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:03:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:03:06,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:06,751 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 16:03:06,752 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:06,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:06,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-12-03 16:03:06,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:06,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:06,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:06,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:09,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:09,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:09,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:09,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:09,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:09,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:09,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:09,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:09,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:09,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:09,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:09,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:03:18,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:03:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:03:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:03:18,388 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 16:03:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:18,618 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:03:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:03:18,618 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 16:03:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:18,619 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:03:18,619 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:03:18,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:03:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:03:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:03:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:03:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 16:03:18,623 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 16:03:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:18,623 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 16:03:18,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:03:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 16:03:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:03:18,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:18,624 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 16:03:18,625 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:18,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-12-03 16:03:18,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:18,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:18,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:18,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:21,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:21,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:21,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:21,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:21,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:21,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:30,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:30,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:03:30,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:30,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:03:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:03:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:03:30,328 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 16:03:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:30,482 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 16:03:30,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:03:30,482 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 16:03:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:30,483 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:03:30,483 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:03:30,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:03:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:03:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:03:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:03:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:03:30,487 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 16:03:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:03:30,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:03:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:03:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:03:30,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:30,488 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 16:03:30,488 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:30,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-12-03 16:03:30,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:30,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:30,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:30,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:33,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:33,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:33,571 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:33,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:33,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:33,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:33,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:33,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:03:33,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:33,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:33,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:42,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:03:42,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:42,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:03:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:03:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:03:42,545 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 16:03:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:42,706 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:03:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:03:42,707 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 16:03:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:42,708 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:03:42,708 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:03:42,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:03:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:03:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:03:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:03:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 16:03:42,712 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 16:03:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:42,712 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 16:03:42,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:03:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 16:03:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:03:42,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:42,713 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 16:03:42,713 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:42,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-12-03 16:03:42,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:42,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:42,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:45,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:45,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:45,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:45,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:45,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:45,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:45,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:45,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:45,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:45,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:45,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:45,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:54,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:54,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:03:54,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:54,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:03:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:03:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:03:54,899 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 16:03:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:55,085 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 16:03:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:03:55,086 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 16:03:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:55,086 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:03:55,086 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:03:55,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:03:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:03:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:03:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:03:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:03:55,090 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 16:03:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:55,090 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:03:55,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:03:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:03:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:03:55,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:55,091 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 16:03:55,091 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:55,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-12-03 16:03:55,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:55,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:55,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:58,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:58,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:58,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:58,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:58,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:58,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:58,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:58,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:58,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:58,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:07,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:07,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:04:07,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:07,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:04:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:04:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:04:07,452 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 16:04:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:07,624 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:04:07,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:04:07,625 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 16:04:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:07,626 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:04:07,626 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:04:07,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:04:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:04:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:04:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:04:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 16:04:07,630 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 16:04:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 16:04:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:04:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 16:04:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:04:07,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:07,631 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 16:04:07,631 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:07,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-12-03 16:04:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:07,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:10,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:10,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:10,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:10,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:10,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:10,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:10,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:10,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:11,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:04:11,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:11,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:11,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:20,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:20,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:04:20,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:20,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:04:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:04:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:04:20,376 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 16:04:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:20,531 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 16:04:20,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:04:20,532 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 16:04:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:20,532 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:04:20,533 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:04:20,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:04:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:04:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:04:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:04:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:04:20,537 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 16:04:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:20,537 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:04:20,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:04:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:04:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:04:20,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:20,538 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 16:04:20,538 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:20,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-12-03 16:04:20,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:20,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:20,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:23,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:23,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:23,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:23,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:23,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:23,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:23,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:23,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:23,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:23,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:23,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:23,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:33,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:33,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:04:33,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:33,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:04:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:04:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:04:33,382 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 16:04:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:33,534 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:04:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:04:33,535 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 16:04:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:33,535 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:04:33,536 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:04:33,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:04:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:04:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:04:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:04:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 16:04:33,541 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 16:04:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:33,541 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 16:04:33,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:04:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 16:04:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:04:33,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:33,542 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 16:04:33,542 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-12-03 16:04:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:33,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:36,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:36,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:36,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:36,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:04:46,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:46,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:04:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:04:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:04:46,455 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 16:04:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:46,674 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 16:04:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:04:46,675 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 16:04:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:46,675 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:04:46,676 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:04:46,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:04:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:04:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:04:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:04:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:04:46,680 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 16:04:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:46,680 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:04:46,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:04:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:04:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:04:46,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:46,680 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 16:04:46,681 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:46,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-12-03 16:04:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:46,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:49,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:49,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:49,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:49,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:49,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:49,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:50,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:04:50,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:50,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:50,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:59,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:59,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:04:59,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:59,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:04:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:04:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:04:59,874 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 16:05:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:00,197 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:05:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:05:00,198 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 16:05:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:00,198 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:05:00,198 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:05:00,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:05:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:05:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:05:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:05:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 16:05:00,202 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 16:05:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:00,202 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 16:05:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:05:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 16:05:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:05:00,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:00,203 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 16:05:00,203 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-12-03 16:05:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:00,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:00,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:03,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:03,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:03,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:03,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:03,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:03,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:03,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:03,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:03,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:03,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:03,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:03,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:13,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:13,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:05:13,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:05:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:05:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:05:13,561 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 16:05:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:13,728 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 16:05:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:05:13,729 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 16:05:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:13,730 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:05:13,730 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:05:13,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:05:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:05:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:05:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:05:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:05:13,735 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 16:05:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:05:13,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:05:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:05:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:05:13,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:13,736 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 16:05:13,737 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:13,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-12-03 16:05:13,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:13,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:13,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:17,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:17,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:17,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:17,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:17,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:17,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:17,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:17,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:17,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:05:27,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:27,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:05:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:05:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:05:27,314 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 16:05:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:27,634 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:05:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:05:27,635 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 16:05:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:27,636 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:05:27,636 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:05:27,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:05:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:05:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:05:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:05:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 16:05:27,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 16:05:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:27,641 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 16:05:27,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:05:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 16:05:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:05:27,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:27,642 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 16:05:27,642 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:27,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-12-03 16:05:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:27,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:31,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:31,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:31,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:31,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:31,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:31,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:31,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:31,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:05:31,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:31,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:31,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:41,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:41,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:05:41,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:41,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:05:41,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:05:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:05:41,607 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 16:05:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:41,850 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 16:05:41,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:05:41,850 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 16:05:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:41,852 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:05:41,852 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:05:41,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:05:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:05:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:05:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:05:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:05:41,856 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 16:05:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:05:41,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:05:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:05:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:05:41,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:41,857 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 16:05:41,858 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:41,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-12-03 16:05:41,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:41,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:41,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:41,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:41,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:45,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:45,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:45,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:45,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:45,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:45,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:45,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:45,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:45,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:45,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:45,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:56,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:56,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:05:56,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:56,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:05:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:05:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:05:56,057 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 16:05:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:56,308 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:05:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:05:56,308 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 16:05:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:56,309 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:05:56,309 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:05:56,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:05:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:05:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:05:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:05:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 16:05:56,314 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 16:05:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:56,314 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 16:05:56,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:05:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 16:05:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:05:56,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:56,315 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 16:05:56,315 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:56,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-12-03 16:05:56,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:00,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:00,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:00,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:00,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:00,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:00,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:00,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:00,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:00,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:00,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:10,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:10,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:06:10,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:10,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:06:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:06:10,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:06:10,825 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 16:06:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:11,142 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 16:06:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:06:11,143 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 16:06:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:11,143 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:06:11,143 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:06:11,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:06:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:06:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:06:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:06:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:06:11,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 16:06:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:11,148 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:06:11,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:06:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:06:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:06:11,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:11,149 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 16:06:11,149 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:11,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-12-03 16:06:11,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:11,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:11,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:14,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:14,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:14,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:14,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:14,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:14,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:14,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:14,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:14,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:06:14,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:14,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:14,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:25,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:06:25,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:25,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:06:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:06:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:06:25,820 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 16:06:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:26,119 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:06:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:06:26,119 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 16:06:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:26,120 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:06:26,120 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:06:26,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:06:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:06:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:06:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:06:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 16:06:26,125 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 16:06:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:26,125 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 16:06:26,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:06:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 16:06:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:06:26,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:26,126 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 16:06:26,126 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:26,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-12-03 16:06:26,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:26,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:26,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:29,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:29,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:29,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:29,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:29,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:29,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:29,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:29,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:29,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:29,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:29,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:41,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:06:41,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:41,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:06:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:06:41,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:06:41,030 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 16:06:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:41,340 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 16:06:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:06:41,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 16:06:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:41,345 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:06:41,345 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:06:41,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:06:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:06:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:06:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:06:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:06:41,348 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 16:06:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:41,348 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:06:41,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:06:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:06:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:06:41,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:41,349 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 16:06:41,349 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:41,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-12-03 16:06:41,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:41,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:41,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:41,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:41,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:45,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:45,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:45,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:45,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:45,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:45,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:56,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:56,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:06:56,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:56,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:06:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:06:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:06:56,607 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 16:06:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:56,922 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:06:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:06:56,923 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 16:06:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:56,924 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:06:56,924 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:06:56,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:06:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:06:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:06:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:06:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 16:06:56,928 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 16:06:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:56,928 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 16:06:56,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:06:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 16:06:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:06:56,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:56,929 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 16:06:56,929 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:56,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-12-03 16:06:56,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:56,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:00,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:00,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:00,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:00,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:00,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:00,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:00,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:00,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:00,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:07:00,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:00,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:00,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:12,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:07:12,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:12,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:07:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:07:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:07:12,398 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 16:07:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:12,649 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 16:07:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:07:12,663 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 16:07:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:12,663 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:07:12,663 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:07:12,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:07:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:07:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:07:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:07:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 16:07:12,666 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 16:07:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:12,666 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 16:07:12,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:07:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 16:07:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:07:12,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:12,667 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 16:07:12,667 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:12,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-12-03 16:07:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:12,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:12,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:16,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:16,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:16,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:16,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:16,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:16,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:16,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:07:16,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:07:16,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:07:16,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:16,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:16,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:28,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:07:28,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:28,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:07:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:07:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:07:28,333 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 16:07:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:28,645 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 16:07:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:07:28,646 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 16:07:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:28,646 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:07:28,646 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:07:28,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:07:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:07:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:07:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:07:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 16:07:28,651 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 16:07:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:28,651 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 16:07:28,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:07:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 16:07:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:07:28,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:28,652 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 16:07:28,652 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:28,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-12-03 16:07:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:28,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:28,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:32,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:32,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:32,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:32,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:32,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:32,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:32,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:07:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:32,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:32,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:44,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:44,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:07:44,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:44,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:07:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:07:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:07:44,608 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 16:07:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:44,954 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 16:07:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:07:44,954 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 16:07:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:44,955 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:07:44,955 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:07:44,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:07:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:07:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:07:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:07:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 16:07:44,960 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 16:07:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:44,960 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 16:07:44,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:07:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 16:07:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:07:44,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:44,961 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 16:07:44,961 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:44,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:44,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-12-03 16:07:44,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:44,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:44,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:44,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:44,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:49,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:49,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:49,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:49,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:49,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:49,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:49,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:49,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:49,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:07:49,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:49,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:49,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:01,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:01,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 16:08:01,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:01,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 16:08:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 16:08:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:08:01,273 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 16:08:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:01,474 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 16:08:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 16:08:01,474 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 16:08:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:01,475 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:08:01,475 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:08:01,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:08:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:08:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:08:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:08:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 16:08:01,479 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 16:08:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:01,479 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 16:08:01,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 16:08:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 16:08:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:08:01,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:01,480 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 16:08:01,480 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:01,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-12-03 16:08:01,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:01,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:01,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:05,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:05,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:05,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:05,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:05,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:05,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:05,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:08:05,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:08:05,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:08:05,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:05,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:05,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:18,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:18,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 16:08:18,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:18,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 16:08:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 16:08:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 16:08:18,153 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 16:08:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:18,497 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 16:08:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 16:08:18,498 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 16:08:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:18,498 INFO L225 Difference]: With dead ends: 118 [2018-12-03 16:08:18,498 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:08:18,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 16:08:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:08:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:08:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:08:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 16:08:18,502 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 16:08:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:18,502 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 16:08:18,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 16:08:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 16:08:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:08:18,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:18,503 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 16:08:18,503 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:18,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-12-03 16:08:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:18,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:18,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:22,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:22,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:22,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:22,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:22,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:22,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:22,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:22,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:35,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:35,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 227 [2018-12-03 16:08:35,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:35,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 16:08:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 16:08:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 16:08:35,390 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-12-03 16:08:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:35,682 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 16:08:35,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 16:08:35,682 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-12-03 16:08:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:35,683 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:08:35,683 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:08:35,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 16:08:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:08:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 16:08:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:08:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-03 16:08:35,687 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-12-03 16:08:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-03 16:08:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 16:08:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-03 16:08:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:08:35,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:35,688 INFO L402 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-12-03 16:08:35,688 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:35,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-12-03 16:08:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:35,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:35,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:40,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:40,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:40,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:40,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:40,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:40,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:40,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:08:40,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 16:08:40,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:40,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:40,203 INFO L316 TraceCheckSpWp]: Computing backward predicates...