java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:21:17,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:21:17,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:21:17,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:21:17,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:21:17,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:21:17,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:21:17,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:21:17,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:21:17,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:21:17,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:21:17,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:21:17,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:21:17,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:21:17,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:21:17,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:21:17,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:21:17,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:21:17,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:21:17,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:21:17,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:21:17,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:21:17,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:21:17,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:21:17,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:21:17,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:21:17,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:21:17,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:21:17,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:21:17,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:21:17,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:21:17,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:21:17,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:21:17,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:21:17,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:21:17,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:21:17,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:21:17,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:21:17,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:21:17,519 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:21:17,520 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:21:17,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:21:17,520 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:21:17,520 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:21:17,521 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:21:17,521 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:21:17,521 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:21:17,521 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:21:17,521 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:21:17,521 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:21:17,525 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:21:17,526 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:21:17,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:21:17,526 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:21:17,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:21:17,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:21:17,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:21:17,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:21:17,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:21:17,529 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:21:17,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:21:17,530 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:21:17,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:21:17,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:21:17,530 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:21:17,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:21:17,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:21:17,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:21:17,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:21:17,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:21:17,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:21:17,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:21:17,534 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:21:17,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:21:17,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:21:17,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:21:17,535 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:21:17,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:21:17,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:21:17,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:21:17,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:21:17,588 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:21:17,589 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl [2018-12-03 19:21:17,590 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl' [2018-12-03 19:21:17,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:21:17,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:21:17,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:21:17,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:21:17,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:21:17,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:21:17,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:21:17,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:21:17,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:21:17,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/1) ... [2018-12-03 19:21:17,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:21:17,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:21:17,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:21:17,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:21:17,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (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 19:21:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:21:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:21:18,071 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:21:18,071 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 19:21:18,072 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:18 BoogieIcfgContainer [2018-12-03 19:21:18,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:21:18,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:21:18,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:21:18,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:21:18,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:21:17" (1/2) ... [2018-12-03 19:21:18,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45404ffb and model type seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:18, skipping insertion in model container [2018-12-03 19:21:18,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:18" (2/2) ... [2018-12-03 19:21:18,081 INFO L112 eAbstractionObserver]: Analyzing ICFG seq.i_4.bpl [2018-12-03 19:21:18,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:21:18,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:21:18,122 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:21:18,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:21:18,169 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:21:18,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:21:18,169 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:21:18,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:21:18,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:21:18,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:21:18,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:21:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 19:21:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:21:18,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:18,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 19:21:18,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:18,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 28787175, now seen corresponding path program 1 times [2018-12-03 19:21:18,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:18,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:18,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:18,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:18,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:18,573 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 19:21:18,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:21:18,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:21:18,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:21:18,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:21:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:21:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:21:18,605 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 19:21:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:18,756 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 19:21:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:21:18,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 19:21:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:18,769 INFO L225 Difference]: With dead ends: 14 [2018-12-03 19:21:18,770 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 19:21:18,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:21:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 19:21:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 19:21:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 19:21:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 19:21:18,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 19:21:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:18,816 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 19:21:18,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:21:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 19:21:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 19:21:18,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:18,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 19:21:18,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:18,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 894126352, now seen corresponding path program 1 times [2018-12-03 19:21:18,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:18,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:18,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:21:18,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:21:18,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:21:19,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 19:21:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 19:21:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:21:19,002 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 19:21:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:19,101 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 19:21:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:21:19,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 19:21:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:19,104 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:21:19,104 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:21:19,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 19:21:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:21:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 19:21:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 19:21:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 19:21:19,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 19:21:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:19,111 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 19:21:19,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 19:21:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 19:21:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:21:19,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:19,114 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 19:21:19,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:19,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash 262017386, now seen corresponding path program 1 times [2018-12-03 19:21:19,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:19,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:19,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:19,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:19,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:19,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:19,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:19,287 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 19:21:19,289 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 19:21:19,349 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:21:19,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:21:20,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:21:20,016 INFO L272 AbstractInterpreter]: Visited 7 different actions 66 times. Merged at 6 different actions 54 times. Widened at 5 different actions 27 times. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 19:21:20,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:20,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:21:20,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:20,064 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 19:21:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:20,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:20,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:20,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 19:21:20,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:21:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:21:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:21:20,937 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 10 states. [2018-12-03 19:21:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:21,204 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 19:21:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:21:21,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 19:21:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:21,206 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:21:21,206 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:21:21,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:21:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:21:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:21:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:21:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 19:21:21,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 19:21:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:21,212 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 19:21:21,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:21:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 19:21:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:21:21,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:21,213 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 19:21:21,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:21,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1187728801, now seen corresponding path program 2 times [2018-12-03 19:21:21,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:21,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:21,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:21,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:21,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:21,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:21,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 19:21:21,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:21,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 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 19:21:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:21,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:21,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:21:21,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:21,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:21,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:21,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:21,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-03 19:21:21,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:21,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:21:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:21:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:21:21,493 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 19:21:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:21,855 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-12-03 19:21:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:21:21,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 19:21:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:21,857 INFO L225 Difference]: With dead ends: 18 [2018-12-03 19:21:21,857 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:21:21,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:21:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:21:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 19:21:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 19:21:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 19:21:21,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-12-03 19:21:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:21,869 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 19:21:21,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:21:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 19:21:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 19:21:21,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:21,871 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 19:21:21,871 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:21,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1053870661, now seen corresponding path program 3 times [2018-12-03 19:21:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:21,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:21,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:22,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:22,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:22,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:22,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:22,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:22,202 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 19:21:22,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:22,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:22,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:22,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:22,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:22,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 19:21:22,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:22,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 19:21:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 19:21:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:21:22,525 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 14 states. [2018-12-03 19:21:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:22,825 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-03 19:21:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 19:21:22,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-12-03 19:21:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:22,826 INFO L225 Difference]: With dead ends: 22 [2018-12-03 19:21:22,826 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:21:22,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:21:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:21:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 19:21:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 19:21:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 19:21:22,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 19:21:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:22,831 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 19:21:22,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 19:21:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 19:21:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 19:21:22,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:22,832 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 19:21:22,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:22,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1170114012, now seen corresponding path program 4 times [2018-12-03 19:21:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:22,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:22,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:22,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:22,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:22,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:22,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:22,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:22,991 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 19:21:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:23,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:23,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:23,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:23,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:23,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2018-12-03 19:21:23,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:23,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 19:21:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 19:21:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:21:23,128 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-12-03 19:21:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:23,370 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 19:21:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:21:23,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 19:21:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:23,373 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:21:23,374 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:21:23,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 19:21:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:21:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 19:21:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 19:21:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 19:21:23,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 19:21:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:23,381 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 19:21:23,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 19:21:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 19:21:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 19:21:23,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:23,382 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-12-03 19:21:23,383 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 801918334, now seen corresponding path program 5 times [2018-12-03 19:21:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:23,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:23,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:23,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:23,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:23,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:23,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:23,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:23,531 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 19:21:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:23,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:23,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 19:21:23,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:23,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:23,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:23,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:23,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 19:21:23,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:23,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 19:21:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 19:21:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:21:23,867 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 18 states. [2018-12-03 19:21:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:23,980 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 19:21:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 19:21:23,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-12-03 19:21:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:23,981 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:21:23,982 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:21:23,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:21:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:21:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 19:21:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 19:21:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 19:21:23,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 19:21:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:23,987 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 19:21:23,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 19:21:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 19:21:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:21:23,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:23,988 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-12-03 19:21:23,988 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -460110731, now seen corresponding path program 6 times [2018-12-03 19:21:23,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:23,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:23,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:24,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:24,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:24,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:24,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:24,143 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 19:21:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:24,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:24,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:24,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:24,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:24,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:24,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2018-12-03 19:21:24,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:24,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:21:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:21:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:21:24,321 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-12-03 19:21:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:24,462 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-03 19:21:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:21:24,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 19:21:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:24,465 INFO L225 Difference]: With dead ends: 24 [2018-12-03 19:21:24,465 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:21:24,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-03 19:21:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:21:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 19:21:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 19:21:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 19:21:24,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-03 19:21:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:24,473 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 19:21:24,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:21:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 19:21:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:21:24,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:24,474 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-12-03 19:21:24,474 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:24,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash 215271311, now seen corresponding path program 7 times [2018-12-03 19:21:24,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:24,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:24,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:24,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:24,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:24,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:24,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:24,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:24,667 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 19:21:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:24,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:24,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:24,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:25,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:25,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 19:21:25,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:25,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 19:21:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 19:21:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:21:25,233 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-12-03 19:21:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:25,766 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 19:21:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 19:21:25,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-12-03 19:21:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:25,767 INFO L225 Difference]: With dead ends: 32 [2018-12-03 19:21:25,767 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:21:25,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-12-03 19:21:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:21:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 19:21:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 19:21:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 19:21:25,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-12-03 19:21:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:25,775 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 19:21:25,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 19:21:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 19:21:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:21:25,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:25,776 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-12-03 19:21:25,777 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:25,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1251105080, now seen corresponding path program 8 times [2018-12-03 19:21:25,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:25,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:25,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:25,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:25,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:25,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:25,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:25,920 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 19:21:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:25,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:26,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 19:21:26,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:26,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:26,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:26,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2018-12-03 19:21:26,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:26,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 19:21:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 19:21:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:21:26,288 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2018-12-03 19:21:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:26,514 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 19:21:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:21:26,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 19:21:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:26,515 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:21:26,515 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:21:26,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:21:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:21:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 19:21:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 19:21:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 19:21:26,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 19:21:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:26,523 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 19:21:26,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 19:21:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 19:21:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:21:26,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:26,525 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-12-03 19:21:26,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:26,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -278808686, now seen corresponding path program 9 times [2018-12-03 19:21:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:26,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:26,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:26,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:26,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:26,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:26,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:26,895 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 19:21:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:26,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:26,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:26,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:26,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:27,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:27,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:27,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 19:21:27,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:27,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 19:21:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 19:21:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:21:27,349 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2018-12-03 19:21:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:27,668 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-03 19:21:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:21:27,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 20 [2018-12-03 19:21:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:27,669 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:21:27,670 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:21:27,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:21:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:21:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 19:21:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 19:21:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 19:21:27,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 19:21:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:27,676 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 19:21:27,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 19:21:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 19:21:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 19:21:27,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:27,677 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-12-03 19:21:27,678 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1095018167, now seen corresponding path program 10 times [2018-12-03 19:21:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:27,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:27,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:27,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:27,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:27,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:27,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:27,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:27,847 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 19:21:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:27,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:27,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:27,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:28,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:28,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 11 [2018-12-03 19:21:28,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:28,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 19:21:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 19:21:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:21:28,049 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-12-03 19:21:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:28,186 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-03 19:21:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:21:28,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-03 19:21:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:28,187 INFO L225 Difference]: With dead ends: 30 [2018-12-03 19:21:28,188 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:21:28,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:21:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:21:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 19:21:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:21:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 19:21:28,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-03 19:21:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:28,195 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 19:21:28,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 19:21:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 19:21:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 19:21:28,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:28,196 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-12-03 19:21:28,196 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:28,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash -45418653, now seen corresponding path program 11 times [2018-12-03 19:21:28,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:28,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:28,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:28,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:28,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:28,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:28,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:28,405 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 19:21:28,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:28,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:28,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 19:21:28,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:28,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:28,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 19:21:28,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 19:21:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 19:21:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:21:28,925 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 30 states. [2018-12-03 19:21:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:29,144 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 19:21:29,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:21:29,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-12-03 19:21:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:29,144 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:21:29,145 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:21:29,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 19:21:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:21:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 19:21:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 19:21:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 19:21:29,152 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 19:21:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:29,152 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 19:21:29,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 19:21:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 19:21:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:21:29,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:29,154 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-12-03 19:21:29,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:29,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1932204468, now seen corresponding path program 12 times [2018-12-03 19:21:29,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:29,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:29,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:29,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:29,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:29,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:29,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:29,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:29,331 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 19:21:29,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:29,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:29,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:29,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:29,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:29,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:29,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:29,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2018-12-03 19:21:29,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:29,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 19:21:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 19:21:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 19:21:29,668 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 19:21:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:29,928 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 19:21:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:21:29,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 19:21:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:29,929 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:21:29,929 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:21:29,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-03 19:21:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:21:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-03 19:21:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 19:21:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 19:21:29,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 19:21:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:29,937 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 19:21:29,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 19:21:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 19:21:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:21:29,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:29,938 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-12-03 19:21:29,938 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:29,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1422569562, now seen corresponding path program 13 times [2018-12-03 19:21:29,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:29,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:29,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:30,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:30,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:30,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:30,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:30,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:30,129 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 19:21:30,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:30,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:30,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:30,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:30,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:30,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 19:21:30,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:30,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 19:21:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 19:21:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:21:30,779 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 34 states. [2018-12-03 19:21:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:31,083 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 19:21:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 19:21:31,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 26 [2018-12-03 19:21:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:31,084 INFO L225 Difference]: With dead ends: 47 [2018-12-03 19:21:31,084 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:21:31,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:21:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:21:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 19:21:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 19:21:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 19:21:31,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 19:21:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:31,091 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 19:21:31,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 19:21:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 19:21:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 19:21:31,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:31,092 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-12-03 19:21:31,093 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:31,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1873185821, now seen corresponding path program 14 times [2018-12-03 19:21:31,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:31,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:31,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:31,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:31,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:31,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:31,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 19:21:31,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:31,803 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 19:21:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:31,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:31,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 19:21:31,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:31,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:31,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2018-12-03 19:21:32,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:32,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 19:21:32,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 19:21:32,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:21:32,106 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 19:21:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:32,305 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 19:21:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:21:32,305 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 19:21:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:32,306 INFO L225 Difference]: With dead ends: 36 [2018-12-03 19:21:32,307 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:21:32,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:21:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:21:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 19:21:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:21:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 19:21:32,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-03 19:21:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:32,315 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 19:21:32,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 19:21:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 19:21:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 19:21:32,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:32,316 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-12-03 19:21:32,316 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:32,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 540329271, now seen corresponding path program 15 times [2018-12-03 19:21:32,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:32,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:32,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:32,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:32,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:32,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:32,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:32,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:32,781 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 19:21:32,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:32,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:32,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:32,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:32,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:33,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:33,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 19:21:33,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:33,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:21:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:21:33,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:21:33,392 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 38 states. [2018-12-03 19:21:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:34,047 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 19:21:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 19:21:34,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 29 [2018-12-03 19:21:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:34,049 INFO L225 Difference]: With dead ends: 52 [2018-12-03 19:21:34,049 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:21:34,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=1693, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 19:21:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:21:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 19:21:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:21:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 19:21:34,057 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-12-03 19:21:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:34,057 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 19:21:34,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:21:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 19:21:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:21:34,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:34,058 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-12-03 19:21:34,059 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:34,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1436557664, now seen corresponding path program 16 times [2018-12-03 19:21:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:34,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:34,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:34,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:34,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:34,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:34,656 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 19:21:34,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:34,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:34,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:34,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:34,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:34,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2018-12-03 19:21:34,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:34,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 19:21:34,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 19:21:34,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 19:21:34,895 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-03 19:21:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:35,101 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 19:21:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:21:35,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-03 19:21:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:35,103 INFO L225 Difference]: With dead ends: 39 [2018-12-03 19:21:35,103 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:21:35,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-12-03 19:21:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:21:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-03 19:21:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 19:21:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 19:21:35,111 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 19:21:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:35,112 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 19:21:35,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 19:21:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 19:21:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 19:21:35,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:35,113 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-12-03 19:21:35,113 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:35,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1847465402, now seen corresponding path program 17 times [2018-12-03 19:21:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:35,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:35,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:35,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:35,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:35,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:35,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:35,590 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 19:21:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:35,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:35,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 19:21:35,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:35,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:36,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:36,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:36,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 19:21:36,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:36,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:21:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:21:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1351, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:21:36,484 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 42 states. [2018-12-03 19:21:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:37,070 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 19:21:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 19:21:37,071 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 32 [2018-12-03 19:21:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:37,071 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:21:37,072 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:21:37,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 19 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:21:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:21:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 19:21:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 19:21:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 19:21:37,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 19:21:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:37,080 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 19:21:37,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:21:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 19:21:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 19:21:37,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:37,081 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-12-03 19:21:37,081 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:37,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash -424157967, now seen corresponding path program 18 times [2018-12-03 19:21:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:37,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:37,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:37,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:37,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:37,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:37,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 19:21:37,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:37,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 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 19:21:37,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:37,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:37,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:37,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:37,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:37,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:37,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:37,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 15 [2018-12-03 19:21:37,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:37,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 19:21:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 19:21:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:21:37,489 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2018-12-03 19:21:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:37,684 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 19:21:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:21:37,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-03 19:21:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:37,686 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:21:37,686 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:21:37,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-12-03 19:21:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:21:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-03 19:21:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:21:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 19:21:37,694 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-03 19:21:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:37,694 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 19:21:37,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 19:21:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 19:21:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:21:37,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:37,695 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-12-03 19:21:37,696 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:37,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 406139147, now seen corresponding path program 19 times [2018-12-03 19:21:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:37,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:37,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:38,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:38,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:38,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:38,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:38,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:38,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 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 19:21:38,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:38,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:38,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:38,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:39,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:39,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 19:21:39,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:39,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 19:21:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 19:21:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1629, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:21:39,052 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 46 states. [2018-12-03 19:21:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:39,598 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 19:21:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 19:21:39,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 35 [2018-12-03 19:21:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:39,599 INFO L225 Difference]: With dead ends: 62 [2018-12-03 19:21:39,599 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:21:39,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 26 SyntacticMatches, 21 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=672, Invalid=2520, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 19:21:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:21:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 19:21:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:21:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 19:21:39,608 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 19:21:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:39,608 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 19:21:39,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 19:21:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 19:21:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:21:39,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:39,609 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-12-03 19:21:39,609 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:39,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2020930956, now seen corresponding path program 20 times [2018-12-03 19:21:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:39,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:39,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:39,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:39,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:39,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:39,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:39,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:39,859 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 19:21:39,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:39,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:39,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 19:21:39,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:39,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:39,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:40,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:40,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2018-12-03 19:21:40,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:40,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 19:21:40,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 19:21:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:21:40,510 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-03 19:21:41,134 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-12-03 19:21:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:41,483 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 19:21:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:21:41,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-03 19:21:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:41,487 INFO L225 Difference]: With dead ends: 45 [2018-12-03 19:21:41,487 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 19:21:41,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-12-03 19:21:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 19:21:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 19:21:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 19:21:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 19:21:41,498 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 19:21:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:41,499 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 19:21:41,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 19:21:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 19:21:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 19:21:41,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:41,500 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-12-03 19:21:41,500 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:41,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash -789378610, now seen corresponding path program 21 times [2018-12-03 19:21:41,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:41,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:41,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:41,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:41,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:42,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:42,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:42,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:42,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:42,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:42,021 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 19:21:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:42,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:42,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:42,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:42,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:42,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:42,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:42,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 19:21:42,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:42,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 19:21:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 19:21:42,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=1933, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:21:42,883 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 50 states. [2018-12-03 19:21:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:43,502 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 19:21:43,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 19:21:43,502 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 38 [2018-12-03 19:21:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:43,503 INFO L225 Difference]: With dead ends: 67 [2018-12-03 19:21:43,503 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:21:43,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 23 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=787, Invalid=2995, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:21:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:21:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:21:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:21:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 19:21:43,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 19:21:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:43,515 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 19:21:43,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 19:21:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 19:21:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:21:43,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:43,516 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-12-03 19:21:43,516 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:43,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash 139611077, now seen corresponding path program 22 times [2018-12-03 19:21:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:43,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:43,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:44,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:44,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:44,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:44,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:44,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:44,796 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 19:21:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:44,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:44,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:44,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:45,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2018-12-03 19:21:45,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:45,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 19:21:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 19:21:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:21:45,125 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-03 19:21:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:45,470 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-03 19:21:45,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:21:45,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-03 19:21:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:45,471 INFO L225 Difference]: With dead ends: 48 [2018-12-03 19:21:45,471 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:21:45,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-12-03 19:21:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:21:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-03 19:21:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:21:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 19:21:45,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-03 19:21:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:45,482 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 19:21:45,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 19:21:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 19:21:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:21:45,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:45,483 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-12-03 19:21:45,483 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:45,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1022311135, now seen corresponding path program 23 times [2018-12-03 19:21:45,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:45,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:45,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:45,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:45,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:45,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:45,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:45,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:45,868 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 19:21:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:45,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:45,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 19:21:45,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:45,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:46,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 19:21:46,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:46,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 19:21:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 19:21:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2263, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:21:46,804 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 54 states. [2018-12-03 19:21:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:47,445 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 19:21:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 19:21:47,446 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 41 [2018-12-03 19:21:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:47,446 INFO L225 Difference]: With dead ends: 72 [2018-12-03 19:21:47,446 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 19:21:47,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 25 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=911, Invalid=3511, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 19:21:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 19:21:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 19:21:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 19:21:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 19:21:47,455 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-12-03 19:21:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:47,455 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 19:21:47,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 19:21:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 19:21:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 19:21:47,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:47,456 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-12-03 19:21:47,457 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:47,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -215178872, now seen corresponding path program 24 times [2018-12-03 19:21:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:47,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:47,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:47,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:47,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:47,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:47,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:47,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:47,782 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 19:21:47,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:47,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:47,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:47,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:47,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:47,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:48,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:48,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 18 [2018-12-03 19:21:48,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:48,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 19:21:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 19:21:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:21:48,125 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2018-12-03 19:21:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:48,384 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 19:21:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:21:48,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-12-03 19:21:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:48,385 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:21:48,385 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 19:21:48,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 19:21:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 19:21:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 19:21:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 19:21:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 19:21:48,396 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 19:21:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:48,396 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 19:21:48,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 19:21:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 19:21:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:21:48,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:48,397 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-12-03 19:21:48,398 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:48,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash -628413470, now seen corresponding path program 25 times [2018-12-03 19:21:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:48,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:48,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:48,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:48,833 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:48,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:48,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 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 19:21:48,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:48,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:48,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:49,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 19:21:49,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:49,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 19:21:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 19:21:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=2619, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:21:49,855 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 58 states. [2018-12-03 19:21:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:50,461 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 19:21:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 19:21:50,462 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 44 [2018-12-03 19:21:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:50,462 INFO L225 Difference]: With dead ends: 77 [2018-12-03 19:21:50,462 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:21:50,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 27 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1044, Invalid=4068, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 19:21:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:21:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 19:21:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 19:21:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 19:21:50,472 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 19:21:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:50,472 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 19:21:50,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 19:21:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 19:21:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 19:21:50,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:50,473 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-12-03 19:21:50,473 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:50,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1306056857, now seen corresponding path program 26 times [2018-12-03 19:21:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:50,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:50,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:50,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:50,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:50,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 19:21:50,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:50,886 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 19:21:50,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:50,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:50,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 19:21:50,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:50,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:50,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:51,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 19 [2018-12-03 19:21:51,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:51,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 19:21:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 19:21:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:21:51,189 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 20 states. [2018-12-03 19:21:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:51,467 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-03 19:21:51,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:21:51,468 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-03 19:21:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:51,468 INFO L225 Difference]: With dead ends: 54 [2018-12-03 19:21:51,469 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:21:51,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 19:21:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:21:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 19:21:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:21:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 19:21:51,478 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-03 19:21:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:51,478 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 19:21:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 19:21:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 19:21:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 19:21:51,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:51,478 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-12-03 19:21:51,479 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash 990241459, now seen corresponding path program 27 times [2018-12-03 19:21:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:51,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:51,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:51,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:51,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:51,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:51,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:51,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:51,891 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 19:21:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:51,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:51,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:51,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:51,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:52,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 19:21:53,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:53,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 19:21:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 19:21:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=3001, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:21:53,357 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 62 states. [2018-12-03 19:21:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:54,460 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-12-03 19:21:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 19:21:54,461 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 47 [2018-12-03 19:21:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:54,461 INFO L225 Difference]: With dead ends: 82 [2018-12-03 19:21:54,461 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 19:21:54,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 29 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1186, Invalid=4666, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 19:21:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 19:21:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 19:21:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 19:21:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 19:21:54,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 19:21:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:54,471 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 19:21:54,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 19:21:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 19:21:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 19:21:54,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:54,472 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-12-03 19:21:54,472 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:54,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash 924575388, now seen corresponding path program 28 times [2018-12-03 19:21:54,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:54,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:54,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:54,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:54,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:54,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:54,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:54,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:54,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:54,772 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 19:21:54,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:54,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:54,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:54,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:55,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:55,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 20 [2018-12-03 19:21:55,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:55,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 19:21:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 19:21:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 19:21:55,115 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-03 19:21:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:55,393 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 19:21:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 19:21:55,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-03 19:21:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:55,394 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:21:55,394 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 19:21:55,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 19:21:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 19:21:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-03 19:21:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:21:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 19:21:55,406 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 19:21:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:55,406 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 19:21:55,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 19:21:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 19:21:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:21:55,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:55,407 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-12-03 19:21:55,408 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -541230090, now seen corresponding path program 29 times [2018-12-03 19:21:55,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:55,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:56,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:56,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:56,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:56,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:56,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:56,094 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 19:21:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:21:56,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:21:56,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 19:21:56,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:56,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:57,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:57,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:57,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 19:21:57,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:57,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 19:21:57,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 19:21:57,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=3409, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 19:21:57,762 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 66 states. [2018-12-03 19:21:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:58,217 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 19:21:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:21:58,217 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 50 [2018-12-03 19:21:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:58,217 INFO L225 Difference]: With dead ends: 87 [2018-12-03 19:21:58,218 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:21:58,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 31 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1337, Invalid=5305, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:21:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:21:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 19:21:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 19:21:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 19:21:58,227 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 19:21:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:58,228 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 19:21:58,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 19:21:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 19:21:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 19:21:58,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:58,228 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-12-03 19:21:58,229 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:58,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1705935725, now seen corresponding path program 30 times [2018-12-03 19:21:58,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:58,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:58,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:58,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:58,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:58,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:58,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:21:58,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:58,481 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 19:21:58,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:21:58,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:21:58,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:21:58,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:21:58,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:21:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:58,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:21:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:58,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:21:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 21 [2018-12-03 19:21:58,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:21:58,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 19:21:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 19:21:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:21:58,938 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 22 states. [2018-12-03 19:21:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:21:59,229 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-03 19:21:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 19:21:59,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 19:21:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:21:59,231 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:21:59,231 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:21:59,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 19:21:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:21:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 19:21:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:21:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 19:21:59,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-12-03 19:21:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:21:59,242 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 19:21:59,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 19:21:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 19:21:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 19:21:59,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:21:59,243 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-12-03 19:21:59,244 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:21:59,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:21:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1273223033, now seen corresponding path program 31 times [2018-12-03 19:21:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:21:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:59,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:21:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:21:59,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:21:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:21:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:59,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:21:59,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:21:59,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 19:21:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:21:59,765 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 19:21:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:21:59,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:21:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:21:59,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:00,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:01,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:01,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 19:22:01,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:01,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 19:22:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 19:22:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=987, Invalid=3843, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:22:01,204 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 70 states. [2018-12-03 19:22:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:02,284 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 19:22:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:22:02,285 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 53 [2018-12-03 19:22:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:02,285 INFO L225 Difference]: With dead ends: 92 [2018-12-03 19:22:02,285 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 19:22:02,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 38 SyntacticMatches, 33 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3810 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1497, Invalid=5985, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 19:22:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 19:22:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 19:22:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 19:22:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 19:22:02,296 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-12-03 19:22:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:02,296 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 19:22:02,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 19:22:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 19:22:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 19:22:02,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:02,297 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-12-03 19:22:02,297 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:02,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1611671120, now seen corresponding path program 32 times [2018-12-03 19:22:02,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:02,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:02,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:02,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:02,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:02,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:02,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:02,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:02,757 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 19:22:02,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:02,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:02,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 19:22:02,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:02,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:02,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:03,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:03,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 22 [2018-12-03 19:22:03,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:03,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 19:22:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 19:22:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:22:03,204 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2018-12-03 19:22:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:03,527 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 19:22:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 19:22:03,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 19:22:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:03,528 INFO L225 Difference]: With dead ends: 63 [2018-12-03 19:22:03,529 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 19:22:03,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 19:22:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 19:22:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-03 19:22:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 19:22:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 19:22:03,540 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 19:22:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:03,540 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 19:22:03,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 19:22:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 19:22:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 19:22:03,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:03,541 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-12-03 19:22:03,541 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:03,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:03,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1667299850, now seen corresponding path program 33 times [2018-12-03 19:22:03,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:03,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:03,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:03,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:03,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:04,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:04,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:04,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:04,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:04,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:04,098 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 19:22:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:04,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:04,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:04,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:04,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:05,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:05,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:05,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 19:22:05,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:05,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 19:22:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 19:22:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4303, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:22:05,937 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 74 states. [2018-12-03 19:22:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:06,495 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-12-03 19:22:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:22:06,495 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 56 [2018-12-03 19:22:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:06,496 INFO L225 Difference]: With dead ends: 97 [2018-12-03 19:22:06,496 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:22:06,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 40 SyntacticMatches, 35 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1666, Invalid=6706, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:22:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:22:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 19:22:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 19:22:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 19:22:06,510 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 19:22:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:06,511 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 19:22:06,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 19:22:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 19:22:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 19:22:06,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:06,512 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-12-03 19:22:06,512 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:06,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -751416255, now seen corresponding path program 34 times [2018-12-03 19:22:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:06,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:06,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:07,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:07,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:07,706 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:07,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:07,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:07,706 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 19:22:07,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:07,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:07,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:07,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:08,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:08,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 23 [2018-12-03 19:22:08,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 19:22:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 19:22:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:22:08,117 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-12-03 19:22:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:08,457 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 19:22:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 19:22:08,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 19:22:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:08,458 INFO L225 Difference]: With dead ends: 66 [2018-12-03 19:22:08,458 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 19:22:08,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 19:22:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 19:22:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 19:22:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 19:22:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 19:22:08,470 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-03 19:22:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:08,470 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 19:22:08,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 19:22:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 19:22:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 19:22:08,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:08,471 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-12-03 19:22:08,471 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:08,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash -556463013, now seen corresponding path program 35 times [2018-12-03 19:22:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:08,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:09,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:09,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:09,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:09,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:09,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:09,665 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 19:22:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:09,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:09,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 19:22:09,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:09,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:11,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:12,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:12,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 19:22:12,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:12,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 19:22:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 19:22:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1217, Invalid=4789, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 19:22:12,187 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 78 states. [2018-12-03 19:22:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:13,836 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 19:22:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:22:13,836 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 59 [2018-12-03 19:22:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:13,837 INFO L225 Difference]: With dead ends: 102 [2018-12-03 19:22:13,837 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 19:22:13,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 42 SyntacticMatches, 37 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1844, Invalid=7468, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 19:22:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 19:22:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 19:22:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 19:22:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 19:22:13,851 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 19:22:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:13,852 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 19:22:13,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 19:22:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 19:22:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 19:22:13,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:13,852 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-12-03 19:22:13,853 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:13,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash 138377924, now seen corresponding path program 36 times [2018-12-03 19:22:13,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:13,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:13,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:14,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:14,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:14,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:14,178 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 19:22:14,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:14,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:14,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:14,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:14,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:14,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:14,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:14,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 24 [2018-12-03 19:22:14,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:14,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 19:22:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 19:22:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 19:22:14,745 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2018-12-03 19:22:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:15,114 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 19:22:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 19:22:15,115 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 19:22:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:15,116 INFO L225 Difference]: With dead ends: 69 [2018-12-03 19:22:15,116 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 19:22:15,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 19:22:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 19:22:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 19:22:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 19:22:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 19:22:15,131 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 19:22:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:15,132 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 19:22:15,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 19:22:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 19:22:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 19:22:15,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:15,132 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-12-03 19:22:15,133 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:15,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash -162748898, now seen corresponding path program 37 times [2018-12-03 19:22:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:15,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:15,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:15,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:15,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:15,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:15,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:15,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:15,842 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 19:22:15,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:15,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:15,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:17,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:17,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:17,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 19:22:17,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:17,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 19:22:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 19:22:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1341, Invalid=5301, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:22:17,757 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 82 states. [2018-12-03 19:22:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:19,279 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 19:22:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:22:19,279 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 62 [2018-12-03 19:22:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:19,280 INFO L225 Difference]: With dead ends: 107 [2018-12-03 19:22:19,280 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 19:22:19,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 44 SyntacticMatches, 39 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5322 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2031, Invalid=8271, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:22:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 19:22:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 19:22:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 19:22:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 19:22:19,291 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 19:22:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:19,292 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 19:22:19,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 19:22:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 19:22:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 19:22:19,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:19,292 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-12-03 19:22:19,292 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:19,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1898761451, now seen corresponding path program 38 times [2018-12-03 19:22:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:19,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:19,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:19,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:19,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:19,963 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:19,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:19,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:19,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 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 19:22:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:19,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:20,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 19:22:20,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:20,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:20,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:20,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 25 [2018-12-03 19:22:20,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:20,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 19:22:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 19:22:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:22:20,485 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-12-03 19:22:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:20,869 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 19:22:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:22:20,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-12-03 19:22:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:20,871 INFO L225 Difference]: With dead ends: 72 [2018-12-03 19:22:20,871 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 19:22:20,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 19:22:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 19:22:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-03 19:22:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 19:22:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 19:22:20,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-12-03 19:22:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:20,885 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 19:22:20,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 19:22:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 19:22:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 19:22:20,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:20,885 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-12-03 19:22:20,886 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:20,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash 651398703, now seen corresponding path program 39 times [2018-12-03 19:22:20,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:20,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:20,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:21,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:21,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:21,833 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:21,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:21,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:21,833 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 19:22:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:21,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:21,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:21,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:21,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:23,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 19:22:24,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 19:22:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 19:22:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1471, Invalid=5839, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:22:24,055 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 86 states. [2018-12-03 19:22:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:25,321 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-12-03 19:22:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 19:22:25,321 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 65 [2018-12-03 19:22:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:25,321 INFO L225 Difference]: With dead ends: 112 [2018-12-03 19:22:25,321 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 19:22:25,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 46 SyntacticMatches, 41 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5882 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2227, Invalid=9115, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 19:22:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 19:22:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 19:22:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 19:22:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 19:22:25,334 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-12-03 19:22:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:25,335 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 19:22:25,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 19:22:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 19:22:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:22:25,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:25,335 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-12-03 19:22:25,335 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:25,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1197356584, now seen corresponding path program 40 times [2018-12-03 19:22:25,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:25,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:25,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:25,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:25,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:25,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:25,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:25,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:25,690 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 19:22:25,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:25,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:25,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:25,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:26,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:26,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 26 [2018-12-03 19:22:26,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:26,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 19:22:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 19:22:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 19:22:26,376 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2018-12-03 19:22:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:26,784 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 19:22:26,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:22:26,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-12-03 19:22:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:26,785 INFO L225 Difference]: With dead ends: 75 [2018-12-03 19:22:26,785 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:22:26,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 19:22:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:22:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 19:22:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 19:22:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 19:22:26,804 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 19:22:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:26,804 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 19:22:26,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 19:22:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 19:22:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 19:22:26,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:26,805 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-12-03 19:22:26,805 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:26,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash 391610418, now seen corresponding path program 41 times [2018-12-03 19:22:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:26,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:26,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:26,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:27,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:27,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:27,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:27,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:27,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:27,934 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 19:22:27,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:27,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:28,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 19:22:28,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:28,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:29,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:30,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:30,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 19:22:30,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:30,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 19:22:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 19:22:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1607, Invalid=6403, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 19:22:30,209 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 90 states. [2018-12-03 19:22:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:32,006 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 19:22:32,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 19:22:32,007 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 68 [2018-12-03 19:22:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:32,007 INFO L225 Difference]: With dead ends: 117 [2018-12-03 19:22:32,007 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 19:22:32,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 48 SyntacticMatches, 43 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6470 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2432, Invalid=10000, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 19:22:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 19:22:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 19:22:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 19:22:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 19:22:32,022 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 19:22:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:32,023 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 19:22:32,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 19:22:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 19:22:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 19:22:32,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:32,024 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-12-03 19:22:32,024 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:32,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1511507991, now seen corresponding path program 42 times [2018-12-03 19:22:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:32,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:32,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:32,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:32,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:32,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:32,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:32,427 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 19:22:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:32,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:32,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:32,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:32,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:32,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2018-12-03 19:22:33,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:33,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 19:22:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 19:22:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:22:33,121 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 28 states. [2018-12-03 19:22:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:33,690 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-03 19:22:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:22:33,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-12-03 19:22:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:33,692 INFO L225 Difference]: With dead ends: 78 [2018-12-03 19:22:33,692 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 19:22:33,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 113 SyntacticMatches, 44 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 19:22:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 19:22:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 19:22:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 19:22:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 19:22:33,708 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-03 19:22:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:33,708 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 19:22:33,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 19:22:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 19:22:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 19:22:33,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:33,708 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-12-03 19:22:33,709 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:33,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash -860180989, now seen corresponding path program 43 times [2018-12-03 19:22:33,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:33,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:33,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:33,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:34,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:34,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:34,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:34,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:34,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:34,654 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 19:22:34,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:34,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:34,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:36,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:37,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:37,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 19:22:37,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:37,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 19:22:37,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 19:22:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1749, Invalid=6993, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:22:37,035 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 94 states. [2018-12-03 19:22:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:37,991 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 19:22:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 19:22:37,991 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 71 [2018-12-03 19:22:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:37,991 INFO L225 Difference]: With dead ends: 122 [2018-12-03 19:22:37,992 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:22:37,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 50 SyntacticMatches, 45 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7086 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2646, Invalid=10926, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 19:22:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:22:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 19:22:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 19:22:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 19:22:38,006 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 19:22:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:38,007 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 19:22:38,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 19:22:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 19:22:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 19:22:38,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:38,007 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-12-03 19:22:38,007 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:38,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1202570988, now seen corresponding path program 44 times [2018-12-03 19:22:38,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:38,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:40,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:40,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:40,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:40,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:40,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:40,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 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 19:22:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:40,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:40,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 19:22:40,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:40,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:40,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:41,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:41,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 28 [2018-12-03 19:22:41,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:41,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 19:22:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 19:22:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 19:22:41,204 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2018-12-03 19:22:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:41,651 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 19:22:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 19:22:41,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-12-03 19:22:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:41,651 INFO L225 Difference]: With dead ends: 81 [2018-12-03 19:22:41,652 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 19:22:41,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 19:22:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 19:22:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 19:22:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 19:22:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 19:22:41,667 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 19:22:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:41,667 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 19:22:41,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 19:22:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 19:22:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 19:22:41,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:41,668 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-12-03 19:22:41,668 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:41,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 324569158, now seen corresponding path program 45 times [2018-12-03 19:22:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:41,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:41,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:42,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:42,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:42,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:42,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:42,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:42,694 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 19:22:42,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:42,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:42,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:42,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:42,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:45,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:46,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:46,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 19:22:46,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:46,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 19:22:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 19:22:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1897, Invalid=7609, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:22:46,204 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 98 states. [2018-12-03 19:22:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:48,652 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 19:22:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 19:22:48,653 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 74 [2018-12-03 19:22:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:48,653 INFO L225 Difference]: With dead ends: 127 [2018-12-03 19:22:48,653 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 19:22:48,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 52 SyntacticMatches, 47 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7730 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2869, Invalid=11893, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:22:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 19:22:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 19:22:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 19:22:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 19:22:48,668 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 19:22:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 19:22:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 19:22:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 19:22:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:22:48,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:48,669 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-12-03 19:22:48,669 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -623355203, now seen corresponding path program 46 times [2018-12-03 19:22:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:48,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:48,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:49,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:49,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:49,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:49,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:49,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:49,266 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 19:22:49,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:49,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:49,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:49,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 29 [2018-12-03 19:22:49,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:49,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 19:22:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 19:22:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:22:49,840 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 30 states. [2018-12-03 19:22:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:50,308 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-03 19:22:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 19:22:50,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-12-03 19:22:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:50,309 INFO L225 Difference]: With dead ends: 84 [2018-12-03 19:22:50,309 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 19:22:50,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 123 SyntacticMatches, 48 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 19:22:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 19:22:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 19:22:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 19:22:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 19:22:50,326 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-03 19:22:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:50,327 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 19:22:50,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 19:22:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 19:22:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 19:22:50,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:50,328 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-12-03 19:22:50,328 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:50,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2043843625, now seen corresponding path program 47 times [2018-12-03 19:22:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:50,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:52,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:52,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:52,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:52,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:52,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:52,751 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 19:22:52,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:52,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:52,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 19:22:52,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:52,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:54,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:55,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:55,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 19:22:55,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:55,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 19:22:55,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 19:22:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=8251, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:22:55,719 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 102 states. [2018-12-03 19:22:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:57,248 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 19:22:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 19:22:57,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 77 [2018-12-03 19:22:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:57,249 INFO L225 Difference]: With dead ends: 132 [2018-12-03 19:22:57,249 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 19:22:57,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 54 SyntacticMatches, 49 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8402 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3101, Invalid=12901, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 19:22:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 19:22:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 19:22:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 19:22:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 19:22:57,268 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-12-03 19:22:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:57,268 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 19:22:57,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 19:22:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 19:22:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 19:22:57,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:57,268 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-12-03 19:22:57,269 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:57,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2046456320, now seen corresponding path program 48 times [2018-12-03 19:22:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:58,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:58,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:58,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:58,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:58,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:58,574 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 19:22:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:22:58,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:22:58,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:22:58,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:58,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:58,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 30 [2018-12-03 19:22:59,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:59,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 19:22:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 19:22:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 19:22:59,407 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2018-12-03 19:22:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:59,904 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 19:22:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 19:22:59,904 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-12-03 19:22:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:59,905 INFO L225 Difference]: With dead ends: 87 [2018-12-03 19:22:59,905 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 19:22:59,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 128 SyntacticMatches, 50 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 19:22:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 19:22:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-12-03 19:22:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 19:22:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 19:22:59,927 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 19:22:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:59,927 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 19:22:59,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 19:22:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 19:22:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 19:22:59,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:59,928 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-12-03 19:22:59,928 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:59,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -450445734, now seen corresponding path program 49 times [2018-12-03 19:22:59,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:59,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:59,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:01,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:01,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:01,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:01,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:01,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:01,200 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 19:23:01,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:01,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:23:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:01,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:03,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:04,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:04,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 19:23:04,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:04,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 19:23:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 19:23:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=8919, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 19:23:04,119 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 106 states. [2018-12-03 19:23:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:06,663 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 19:23:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 19:23:06,663 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 80 [2018-12-03 19:23:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:06,664 INFO L225 Difference]: With dead ends: 137 [2018-12-03 19:23:06,664 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 19:23:06,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 56 SyntacticMatches, 51 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9102 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3342, Invalid=13950, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 19:23:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 19:23:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 19:23:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 19:23:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 19:23:06,685 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 19:23:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:06,686 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 19:23:06,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 19:23:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 19:23:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 19:23:06,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:06,686 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-12-03 19:23:06,687 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:06,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1158060945, now seen corresponding path program 50 times [2018-12-03 19:23:06,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:06,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:06,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:07,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:07,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:07,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:07,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 19:23:07,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:07,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 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 19:23:07,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:23:07,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:23:07,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 19:23:07,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:07,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:07,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:07,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 31 [2018-12-03 19:23:07,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:07,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 19:23:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 19:23:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:23:07,968 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 32 states. [2018-12-03 19:23:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:09,367 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-12-03 19:23:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 19:23:09,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-12-03 19:23:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:09,369 INFO L225 Difference]: With dead ends: 90 [2018-12-03 19:23:09,369 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 19:23:09,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 133 SyntacticMatches, 52 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 19:23:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 19:23:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-03 19:23:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 19:23:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 19:23:09,387 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-12-03 19:23:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:09,388 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 19:23:09,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 19:23:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 19:23:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 19:23:09,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:09,388 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-12-03 19:23:09,388 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:09,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 500090795, now seen corresponding path program 51 times [2018-12-03 19:23:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:09,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:09,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:10,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:10,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:10,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:10,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:10,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:10,534 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 19:23:10,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:23:10,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:23:10,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:23:10,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:10,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:12,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:13,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:13,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 19:23:13,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:13,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 19:23:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 19:23:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2377, Invalid=9613, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 19:23:13,632 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 110 states. [2018-12-03 19:23:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:15,984 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-12-03 19:23:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 19:23:15,984 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 83 [2018-12-03 19:23:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:15,985 INFO L225 Difference]: With dead ends: 142 [2018-12-03 19:23:15,985 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 19:23:15,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 58 SyntacticMatches, 53 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9830 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3592, Invalid=15040, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 19:23:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 19:23:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 19:23:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 19:23:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 19:23:16,003 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 19:23:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:16,003 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 19:23:16,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 19:23:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 19:23:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 19:23:16,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:16,004 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-12-03 19:23:16,004 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:16,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash 572443412, now seen corresponding path program 52 times [2018-12-03 19:23:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:16,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:16,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:16,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:16,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:16,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:16,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:16,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:16,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:16,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:16,453 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 19:23:16,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:16,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:23:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:16,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:16,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:17,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:17,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 32 [2018-12-03 19:23:17,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:17,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 19:23:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 19:23:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 19:23:17,327 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 33 states. [2018-12-03 19:23:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:17,874 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 19:23:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 19:23:17,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-12-03 19:23:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:17,876 INFO L225 Difference]: With dead ends: 93 [2018-12-03 19:23:17,876 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 19:23:17,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 138 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 19:23:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 19:23:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-03 19:23:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 19:23:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 19:23:17,895 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 19:23:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:17,896 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 19:23:17,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 19:23:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 19:23:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 19:23:17,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:17,896 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-12-03 19:23:17,897 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:17,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash 362357358, now seen corresponding path program 53 times [2018-12-03 19:23:17,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:17,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:17,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:18,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:18,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:18,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:18,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 19:23:18,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:18,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 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 19:23:18,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:23:18,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:23:19,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 19:23:19,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:19,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:21,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 19:23:22,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:22,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 19:23:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 19:23:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=10333, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 19:23:22,451 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 114 states. [2018-12-03 19:23:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:24,954 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 19:23:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 19:23:24,954 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 86 [2018-12-03 19:23:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:24,954 INFO L225 Difference]: With dead ends: 147 [2018-12-03 19:23:24,954 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 19:23:24,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 60 SyntacticMatches, 55 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10586 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3851, Invalid=16171, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:23:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 19:23:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 19:23:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 19:23:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 19:23:24,978 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 19:23:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:24,978 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 19:23:24,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 19:23:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 19:23:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 19:23:24,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:24,979 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-12-03 19:23:24,979 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:24,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash -254412187, now seen corresponding path program 54 times [2018-12-03 19:23:24,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:24,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:24,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:25,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:25,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:25,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:25,429 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 19:23:25,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:23:25,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:23:25,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:23:25,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:25,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:25,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 33 [2018-12-03 19:23:26,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:26,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 19:23:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 19:23:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:23:26,274 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 34 states. [2018-12-03 19:23:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:26,850 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-12-03 19:23:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 19:23:26,850 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-12-03 19:23:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:26,851 INFO L225 Difference]: With dead ends: 96 [2018-12-03 19:23:26,853 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 19:23:26,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 56 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 19:23:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 19:23:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 19:23:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 19:23:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 19:23:26,876 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-12-03 19:23:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:26,876 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 19:23:26,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 19:23:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 19:23:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 19:23:26,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:26,877 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-12-03 19:23:26,878 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:26,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:26,878 INFO L82 PathProgramCache]: Analyzing trace with hash 323076479, now seen corresponding path program 55 times [2018-12-03 19:23:26,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:26,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:26,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:28,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:28,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:28,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:28,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:28,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:28,051 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 19:23:28,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:28,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:23:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:28,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:30,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:31,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:31,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 19:23:31,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:31,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 19:23:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 19:23:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2727, Invalid=11079, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 19:23:31,846 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 118 states. [2018-12-03 19:23:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:35,190 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 19:23:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 19:23:35,191 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 89 [2018-12-03 19:23:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:35,191 INFO L225 Difference]: With dead ends: 152 [2018-12-03 19:23:35,192 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 19:23:35,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 62 SyntacticMatches, 57 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11370 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4119, Invalid=17343, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 19:23:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 19:23:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 19:23:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 19:23:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 19:23:35,219 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-12-03 19:23:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:35,219 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 19:23:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 19:23:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 19:23:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 19:23:35,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:35,220 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-12-03 19:23:35,221 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:35,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 11653672, now seen corresponding path program 56 times [2018-12-03 19:23:35,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:35,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:35,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:35,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:35,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:35,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:35,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:35,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:35,684 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 19:23:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:23:35,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:23:35,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 19:23:35,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:35,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:35,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:36,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:36,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 34 [2018-12-03 19:23:36,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:36,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 19:23:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 19:23:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 19:23:36,623 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 35 states. [2018-12-03 19:23:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:37,239 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 19:23:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 19:23:37,239 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-12-03 19:23:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:37,240 INFO L225 Difference]: With dead ends: 99 [2018-12-03 19:23:37,241 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 19:23:37,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 58 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 19:23:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 19:23:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-03 19:23:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 19:23:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 19:23:37,267 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 19:23:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:37,267 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 19:23:37,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 19:23:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 19:23:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 19:23:37,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:37,268 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-12-03 19:23:37,268 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:37,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1685670782, now seen corresponding path program 57 times [2018-12-03 19:23:37,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:37,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:37,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:37,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:38,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:38,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:38,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:38,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:38,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:38,568 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 19:23:38,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:23:38,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:23:38,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:23:38,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:38,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:41,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:42,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:42,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 19:23:42,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:42,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 19:23:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 19:23:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2911, Invalid=11851, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:23:42,355 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 122 states. [2018-12-03 19:23:42,963 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 19:23:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:45,406 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-12-03 19:23:45,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 19:23:45,406 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 92 [2018-12-03 19:23:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:45,407 INFO L225 Difference]: With dead ends: 157 [2018-12-03 19:23:45,407 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 19:23:45,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 64 SyntacticMatches, 59 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12182 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4396, Invalid=18556, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:23:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 19:23:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 19:23:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 19:23:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 19:23:45,439 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 19:23:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:45,439 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 19:23:45,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 19:23:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 19:23:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 19:23:45,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:45,440 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-12-03 19:23:45,441 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:45,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2141812537, now seen corresponding path program 58 times [2018-12-03 19:23:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:45,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:45,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:46,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:46,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:46,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:46,216 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 19:23:46,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:46,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:23:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:46,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:46,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 35 [2018-12-03 19:23:47,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:47,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 19:23:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 19:23:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 19:23:47,056 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 36 states. [2018-12-03 19:23:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:47,684 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-12-03 19:23:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 19:23:47,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-12-03 19:23:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:47,685 INFO L225 Difference]: With dead ends: 102 [2018-12-03 19:23:47,685 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:23:47,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 153 SyntacticMatches, 60 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 19:23:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:23:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-12-03 19:23:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 19:23:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 19:23:47,708 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-03 19:23:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:47,709 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 19:23:47,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 19:23:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 19:23:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 19:23:47,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:47,709 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-12-03 19:23:47,710 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:47,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash 992565587, now seen corresponding path program 59 times [2018-12-03 19:23:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:47,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:47,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:49,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:49,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:49,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:49,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:49,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:49,033 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 19:23:49,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:23:49,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:23:49,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 19:23:49,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:49,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:52,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:54,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:54,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 19:23:54,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:54,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 19:23:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 19:23:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3101, Invalid=12649, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 19:23:54,042 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 126 states. [2018-12-03 19:23:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:56,567 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 19:23:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 19:23:56,567 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 95 [2018-12-03 19:23:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:56,568 INFO L225 Difference]: With dead ends: 162 [2018-12-03 19:23:56,568 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 19:23:56,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 66 SyntacticMatches, 61 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13022 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4682, Invalid=19810, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 19:23:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 19:23:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 19:23:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 19:23:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 19:23:56,612 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 19:23:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:56,612 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 19:23:56,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 19:23:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 19:23:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 19:23:56,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:56,613 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-12-03 19:23:56,614 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:56,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1538619588, now seen corresponding path program 60 times [2018-12-03 19:23:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:56,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:56,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:57,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:57,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:57,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:57,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:57,142 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 19:23:57,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:23:57,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:23:57,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:23:57,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:57,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:57,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:58,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:23:58,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 36 [2018-12-03 19:23:58,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:58,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 19:23:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 19:23:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 19:23:58,172 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 37 states. [2018-12-03 19:23:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:58,839 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 19:23:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 19:23:58,839 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-03 19:23:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:58,840 INFO L225 Difference]: With dead ends: 105 [2018-12-03 19:23:58,840 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 19:23:58,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 158 SyntacticMatches, 62 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 19:23:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 19:23:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 19:23:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 19:23:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 19:23:58,865 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 19:23:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:58,865 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 19:23:58,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 19:23:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 19:23:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 19:23:58,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:58,866 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-12-03 19:23:58,866 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:58,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1144621930, now seen corresponding path program 61 times [2018-12-03 19:23:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:58,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:58,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:00,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:00,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:00,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:00,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:00,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:00,453 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 19:24:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:00,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:24:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:00,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:03,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:04,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:04,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 19:24:04,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:04,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 19:24:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 19:24:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3297, Invalid=13473, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 19:24:04,691 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 130 states. [2018-12-03 19:24:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:07,495 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 19:24:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 19:24:07,495 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 98 [2018-12-03 19:24:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:07,496 INFO L225 Difference]: With dead ends: 167 [2018-12-03 19:24:07,496 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:24:07,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 68 SyntacticMatches, 63 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13890 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4977, Invalid=21105, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:24:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:24:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:24:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:24:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 19:24:07,525 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 19:24:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:07,525 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 19:24:07,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 19:24:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 19:24:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 19:24:07,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:07,526 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-12-03 19:24:07,526 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:07,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash -941354483, now seen corresponding path program 62 times [2018-12-03 19:24:07,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:07,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:07,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:07,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:07,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:08,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:08,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:08,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:08,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:08,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:08,081 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 19:24:08,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:24:08,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:24:08,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 19:24:08,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:08,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:08,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:09,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:09,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2018-12-03 19:24:09,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:09,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:24:09,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:24:09,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:24:09,197 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 38 states. [2018-12-03 19:24:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:09,895 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-12-03 19:24:09,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 19:24:09,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 19:24:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:09,897 INFO L225 Difference]: With dead ends: 108 [2018-12-03 19:24:09,897 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 19:24:09,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 19:24:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 19:24:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-03 19:24:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 19:24:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 19:24:09,924 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-12-03 19:24:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:09,924 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 19:24:09,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:24:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 19:24:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 19:24:09,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:09,925 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-12-03 19:24:09,926 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:09,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1596493607, now seen corresponding path program 63 times [2018-12-03 19:24:09,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:09,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:24:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:09,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:11,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:11,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:11,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:11,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 19:24:11,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:11,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 19:24:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:24:11,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:24:11,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:24:11,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:11,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:14,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 19:24:16,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:16,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 19:24:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 19:24:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3499, Invalid=14323, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 19:24:16,219 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 134 states. [2018-12-03 19:24:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:20,176 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 19:24:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 19:24:20,177 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 101 [2018-12-03 19:24:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:20,177 INFO L225 Difference]: With dead ends: 172 [2018-12-03 19:24:20,177 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 19:24:20,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 70 SyntacticMatches, 65 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14786 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5281, Invalid=22441, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 19:24:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 19:24:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 19:24:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 19:24:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 19:24:20,203 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-12-03 19:24:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:20,203 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 19:24:20,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 19:24:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 19:24:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 19:24:20,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:20,204 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-12-03 19:24:20,204 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:20,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1233119824, now seen corresponding path program 64 times [2018-12-03 19:24:20,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:20,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:20,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:24:20,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:20,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:20,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:20,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:20,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:20,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:20,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:20,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 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 19:24:20,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:20,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:24:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:20,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:20,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 38 [2018-12-03 19:24:21,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:21,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 19:24:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 19:24:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 19:24:21,815 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-12-03 19:24:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:22,541 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 19:24:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 19:24:22,541 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-12-03 19:24:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:22,542 INFO L225 Difference]: With dead ends: 111 [2018-12-03 19:24:22,542 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:24:22,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 168 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 19:24:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:24:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 19:24:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 19:24:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 19:24:22,571 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 19:24:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:22,571 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 19:24:22,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 19:24:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 19:24:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 19:24:22,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:22,571 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-12-03 19:24:22,572 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:22,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash -382770518, now seen corresponding path program 65 times [2018-12-03 19:24:22,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:22,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:24,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:24,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:24,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:24,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:24,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:24,072 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 19:24:24,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:24:24,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:24:24,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 19:24:24,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:24,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:27,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:28,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:28,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 19:24:28,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:28,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 19:24:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 19:24:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3707, Invalid=15199, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 19:24:28,906 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 138 states. [2018-12-03 19:24:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:32,608 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 19:24:32,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 19:24:32,608 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 104 [2018-12-03 19:24:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:32,609 INFO L225 Difference]: With dead ends: 177 [2018-12-03 19:24:32,609 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 19:24:32,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 72 SyntacticMatches, 67 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15710 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5594, Invalid=23818, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 19:24:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 19:24:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 19:24:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 19:24:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 19:24:32,637 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 19:24:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:32,637 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 19:24:32,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 19:24:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 19:24:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 19:24:32,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:32,638 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-12-03 19:24:32,638 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:32,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1961413345, now seen corresponding path program 66 times [2018-12-03 19:24:32,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:32,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:24:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:32,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:33,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:33,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:33,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:33,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:33,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:33,214 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 19:24:33,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:24:33,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:24:33,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:24:33,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:33,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:33,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:34,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:34,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 39 [2018-12-03 19:24:34,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 19:24:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 19:24:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:24:34,236 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 40 states. [2018-12-03 19:24:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:34,984 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-12-03 19:24:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 19:24:34,987 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 19:24:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:34,987 INFO L225 Difference]: With dead ends: 114 [2018-12-03 19:24:34,988 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 19:24:34,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 173 SyntacticMatches, 68 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 19:24:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 19:24:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-03 19:24:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 19:24:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 19:24:35,017 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-12-03 19:24:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 19:24:35,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 19:24:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 19:24:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 19:24:35,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:35,018 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-12-03 19:24:35,018 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:35,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash -572366085, now seen corresponding path program 67 times [2018-12-03 19:24:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:35,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:35,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:24:35,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:35,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:36,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:36,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:36,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:36,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:36,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:36,868 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 19:24:36,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:36,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:24:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:36,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:40,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:41,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 19:24:41,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:41,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 19:24:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 19:24:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=16101, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:24:41,989 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 142 states. [2018-12-03 19:24:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:45,700 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 19:24:45,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 19:24:45,700 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 107 [2018-12-03 19:24:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:45,701 INFO L225 Difference]: With dead ends: 182 [2018-12-03 19:24:45,701 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:24:45,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 74 SyntacticMatches, 69 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16662 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=5916, Invalid=25236, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 19:24:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:24:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 19:24:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 19:24:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 19:24:45,729 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 19:24:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:45,730 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 19:24:45,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 19:24:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 19:24:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 19:24:45,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:45,730 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-12-03 19:24:45,731 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:45,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1159136412, now seen corresponding path program 68 times [2018-12-03 19:24:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:45,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:46,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:46,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:46,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:46,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:46,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:46,459 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 19:24:46,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:24:46,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:24:46,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 19:24:46,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:46,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:46,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:47,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:47,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 40 [2018-12-03 19:24:47,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:47,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 19:24:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 19:24:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 19:24:47,607 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 41 states. [2018-12-03 19:24:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:48,392 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 19:24:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 19:24:48,392 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 108 [2018-12-03 19:24:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:48,393 INFO L225 Difference]: With dead ends: 117 [2018-12-03 19:24:48,393 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 19:24:48,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 178 SyntacticMatches, 70 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 19:24:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 19:24:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-03 19:24:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 19:24:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 19:24:48,422 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 19:24:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 19:24:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 19:24:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 19:24:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 19:24:48,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:48,423 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-12-03 19:24:48,423 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1533509954, now seen corresponding path program 69 times [2018-12-03 19:24:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:48,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:24:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:48,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:50,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:50,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:50,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:50,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:50,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:50,143 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 19:24:50,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:24:50,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:24:50,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:24:50,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:24:50,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:53,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:24:55,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:55,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 19:24:55,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:55,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 19:24:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 19:24:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4141, Invalid=17029, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:24:55,339 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 146 states. [2018-12-03 19:25:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:00,208 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 19:25:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 19:25:00,208 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 110 [2018-12-03 19:25:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:00,209 INFO L225 Difference]: With dead ends: 187 [2018-12-03 19:25:00,209 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 19:25:00,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 76 SyntacticMatches, 71 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17642 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6247, Invalid=26695, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:25:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 19:25:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 19:25:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 19:25:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 19:25:00,238 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 19:25:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:00,239 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 19:25:00,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 19:25:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 19:25:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 19:25:00,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:00,239 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-12-03 19:25:00,239 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:00,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1491426891, now seen corresponding path program 70 times [2018-12-03 19:25:00,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:00,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:00,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:00,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:00,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:00,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:00,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:00,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:00,906 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 19:25:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:00,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:01,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:01,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:02,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:02,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 41 [2018-12-03 19:25:02,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:02,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:25:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:25:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:25:02,533 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2018-12-03 19:25:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:03,353 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-12-03 19:25:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 19:25:03,353 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 19:25:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:03,354 INFO L225 Difference]: With dead ends: 120 [2018-12-03 19:25:03,355 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 19:25:03,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 183 SyntacticMatches, 72 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 19:25:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 19:25:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 19:25:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 19:25:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 19:25:03,386 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-12-03 19:25:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:03,386 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 19:25:03,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:25:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 19:25:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 19:25:03,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:03,387 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-12-03 19:25:03,387 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:03,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1257886927, now seen corresponding path program 71 times [2018-12-03 19:25:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:03,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:05,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:05,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:05,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:05,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 19:25:05,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:05,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 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 19:25:05,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:05,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:05,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 19:25:05,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:05,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:09,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 19:25:10,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:10,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 19:25:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 19:25:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4367, Invalid=17983, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 19:25:10,855 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 150 states. [2018-12-03 19:25:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:14,792 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 19:25:14,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 19:25:14,792 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 113 [2018-12-03 19:25:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:14,793 INFO L225 Difference]: With dead ends: 192 [2018-12-03 19:25:14,793 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 19:25:14,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 78 SyntacticMatches, 73 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18650 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6587, Invalid=28195, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 19:25:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 19:25:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 19:25:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 19:25:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 19:25:14,823 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-12-03 19:25:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:14,823 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 19:25:14,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 19:25:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 19:25:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 19:25:14,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:14,824 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-12-03 19:25:14,824 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:14,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 823966328, now seen corresponding path program 72 times [2018-12-03 19:25:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:14,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:14,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:14,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:14,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:15,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:15,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:15,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:15,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:15,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:15,483 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 19:25:15,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:25:15,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:25:15,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:25:15,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:15,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:15,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:16,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:16,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 42 [2018-12-03 19:25:16,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:16,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 19:25:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 19:25:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 19:25:16,702 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 43 states. [2018-12-03 19:25:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:17,616 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 19:25:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 19:25:17,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-12-03 19:25:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:17,617 INFO L225 Difference]: With dead ends: 123 [2018-12-03 19:25:17,617 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 19:25:17,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 188 SyntacticMatches, 74 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 19:25:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 19:25:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-12-03 19:25:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 19:25:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 19:25:17,651 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 19:25:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:17,651 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 19:25:17,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 19:25:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 19:25:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 19:25:17,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:17,651 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-12-03 19:25:17,652 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:17,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1557711058, now seen corresponding path program 73 times [2018-12-03 19:25:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:17,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:17,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:19,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:19,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:19,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:19,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:19,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:19,532 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 19:25:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:19,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:19,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:23,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:25,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 19:25:25,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:25,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 19:25:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 19:25:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4599, Invalid=18963, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:25:25,418 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 154 states. [2018-12-03 19:25:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:29,010 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 19:25:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 19:25:29,010 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 116 [2018-12-03 19:25:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:29,011 INFO L225 Difference]: With dead ends: 197 [2018-12-03 19:25:29,011 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 19:25:29,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 80 SyntacticMatches, 75 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19686 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=6936, Invalid=29736, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:25:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 19:25:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 19:25:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 19:25:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 19:25:29,042 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 19:25:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:29,043 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 19:25:29,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 19:25:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 19:25:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 19:25:29,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:29,043 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-12-03 19:25:29,043 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:29,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:29,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1814260087, now seen corresponding path program 74 times [2018-12-03 19:25:29,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:29,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:29,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:29,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:29,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:29,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:29,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:29,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:29,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:29,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:29,765 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 19:25:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:29,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:29,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 19:25:29,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:29,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:29,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 43 [2018-12-03 19:25:31,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:31,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 19:25:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 19:25:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:25:31,069 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 44 states. [2018-12-03 19:25:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:31,977 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-12-03 19:25:31,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 19:25:31,977 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-12-03 19:25:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:31,978 INFO L225 Difference]: With dead ends: 126 [2018-12-03 19:25:31,978 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 19:25:31,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 76 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 19:25:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 19:25:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 19:25:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 19:25:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 19:25:32,012 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-03 19:25:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:32,012 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 19:25:32,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 19:25:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 19:25:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 19:25:32,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:32,013 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-12-03 19:25:32,013 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:32,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash 252830883, now seen corresponding path program 75 times [2018-12-03 19:25:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:32,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:32,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:34,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:34,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:34,206 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:34,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:34,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:34,206 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 19:25:34,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:25:34,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:25:34,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:25:34,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:34,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:38,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:40,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:40,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 19:25:40,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:40,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 19:25:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 19:25:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=19969, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:25:40,346 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 158 states. [2018-12-03 19:25:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:44,764 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-03 19:25:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 19:25:44,764 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 119 [2018-12-03 19:25:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:44,765 INFO L225 Difference]: With dead ends: 202 [2018-12-03 19:25:44,765 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 19:25:44,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 82 SyntacticMatches, 77 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20750 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=7294, Invalid=31318, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 19:25:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 19:25:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 19:25:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 19:25:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 19:25:44,801 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-12-03 19:25:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:44,801 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 19:25:44,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 19:25:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 19:25:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 19:25:44,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:44,802 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-12-03 19:25:44,802 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:44,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 850536332, now seen corresponding path program 76 times [2018-12-03 19:25:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:44,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:25:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:44,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:45,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:45,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:45,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:45,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:45,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:45,546 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 19:25:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:45,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:25:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:45,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:45,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:46,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:46,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 44 [2018-12-03 19:25:46,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:46,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 19:25:46,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 19:25:46,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 19:25:46,902 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 45 states. [2018-12-03 19:25:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:47,972 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 19:25:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 19:25:47,973 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 120 [2018-12-03 19:25:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:47,973 INFO L225 Difference]: With dead ends: 129 [2018-12-03 19:25:47,974 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 19:25:47,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 198 SyntacticMatches, 78 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 19:25:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 19:25:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-12-03 19:25:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 19:25:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 19:25:48,011 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 19:25:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:48,011 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 19:25:48,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 19:25:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 19:25:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 19:25:48,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:48,012 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-12-03 19:25:48,012 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:48,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1321681126, now seen corresponding path program 77 times [2018-12-03 19:25:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:48,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:48,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:48,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:48,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:50,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:50,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:50,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:25:50,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:25:50,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:50,130 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 19:25:50,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:25:50,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:50,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 19:25:50,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:50,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:54,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:25:56,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:56,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 19:25:56,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:56,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 19:25:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 19:25:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5081, Invalid=21001, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:25:56,947 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 162 states. [2018-12-03 19:26:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:03,155 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 19:26:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 19:26:03,155 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 122 [2018-12-03 19:26:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:03,155 INFO L225 Difference]: With dead ends: 207 [2018-12-03 19:26:03,156 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 19:26:03,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 84 SyntacticMatches, 79 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21842 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=7661, Invalid=32941, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:26:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 19:26:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 19:26:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 19:26:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 19:26:03,192 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 19:26:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:03,193 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 19:26:03,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 19:26:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 19:26:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 19:26:03,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:03,193 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-12-03 19:26:03,193 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:03,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 630303069, now seen corresponding path program 78 times [2018-12-03 19:26:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:03,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:03,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:03,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:04,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:04,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:04,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:04,005 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 19:26:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:26:04,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:26:04,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:26:04,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:04,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:04,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:05,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:05,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 45 [2018-12-03 19:26:05,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:05,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 19:26:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 19:26:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:26:05,455 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 46 states. [2018-12-03 19:26:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:06,440 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-12-03 19:26:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 19:26:06,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-03 19:26:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:06,441 INFO L225 Difference]: With dead ends: 132 [2018-12-03 19:26:06,441 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 19:26:06,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 203 SyntacticMatches, 80 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 19:26:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 19:26:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-03 19:26:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 19:26:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 19:26:06,481 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-12-03 19:26:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:06,481 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 19:26:06,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 19:26:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 19:26:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 19:26:06,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:06,482 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-12-03 19:26:06,482 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:06,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash 130912887, now seen corresponding path program 79 times [2018-12-03 19:26:06,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:06,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:06,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:09,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:09,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:09,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:09,024 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 19:26:09,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:09,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:26:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:09,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:13,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:15,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:15,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 19:26:15,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 19:26:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 19:26:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5331, Invalid=22059, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:26:15,959 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 166 states. [2018-12-03 19:26:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:21,498 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 19:26:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 19:26:21,499 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 125 [2018-12-03 19:26:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:21,499 INFO L225 Difference]: With dead ends: 212 [2018-12-03 19:26:21,499 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 19:26:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 86 SyntacticMatches, 81 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22962 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=8037, Invalid=34605, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 19:26:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 19:26:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 19:26:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 19:26:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 19:26:21,552 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-12-03 19:26:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:21,552 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 19:26:21,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 19:26:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 19:26:21,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 19:26:21,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:21,553 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-12-03 19:26:21,553 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:21,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1950368416, now seen corresponding path program 80 times [2018-12-03 19:26:21,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:21,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:21,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:21,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:22,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:22,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:22,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:22,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:22,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:22,421 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 19:26:22,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:26:22,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:26:22,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 19:26:22,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:22,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:22,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:24,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:24,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 46 [2018-12-03 19:26:24,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:24,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 19:26:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 19:26:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 19:26:24,214 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 47 states. [2018-12-03 19:26:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:25,248 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 19:26:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 19:26:25,248 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2018-12-03 19:26:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:25,249 INFO L225 Difference]: With dead ends: 135 [2018-12-03 19:26:25,249 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 19:26:25,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 208 SyntacticMatches, 82 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 19:26:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 19:26:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-03 19:26:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 19:26:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 19:26:25,299 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 19:26:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:25,300 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 19:26:25,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 19:26:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 19:26:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 19:26:25,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:25,301 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-12-03 19:26:25,301 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:25,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1698359034, now seen corresponding path program 81 times [2018-12-03 19:26:25,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:25,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:25,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:27,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:27,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:27,708 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:27,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:27,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:27,708 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 19:26:27,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:26:27,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:26:27,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:26:27,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:27,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:32,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:35,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 19:26:35,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:35,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 19:26:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 19:26:35,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5587, Invalid=23143, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:26:35,279 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 170 states. [2018-12-03 19:26:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:39,892 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-12-03 19:26:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 19:26:39,893 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 128 [2018-12-03 19:26:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:39,893 INFO L225 Difference]: With dead ends: 217 [2018-12-03 19:26:39,893 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 19:26:39,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 88 SyntacticMatches, 83 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24110 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=8422, Invalid=36310, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:26:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 19:26:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 19:26:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 19:26:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 19:26:39,940 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 19:26:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:39,940 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 19:26:39,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 19:26:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 19:26:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 19:26:39,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:39,941 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-12-03 19:26:39,941 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:39,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1684219343, now seen corresponding path program 82 times [2018-12-03 19:26:39,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:39,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:39,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:26:39,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:39,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:40,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:40,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:40,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:40,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:26:40,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:40,947 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 19:26:40,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:40,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:26:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:41,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:41,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:42,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:42,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 47 [2018-12-03 19:26:42,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:42,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 19:26:42,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 19:26:42,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 19:26:42,533 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2018-12-03 19:26:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:26:43,564 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-12-03 19:26:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 19:26:43,565 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-12-03 19:26:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:26:43,565 INFO L225 Difference]: With dead ends: 138 [2018-12-03 19:26:43,565 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 19:26:43,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 213 SyntacticMatches, 84 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 19:26:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 19:26:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-12-03 19:26:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 19:26:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 19:26:43,615 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-12-03 19:26:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:26:43,615 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 19:26:43,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 19:26:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 19:26:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 19:26:43,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:26:43,616 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-12-03 19:26:43,616 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:26:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:26:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 667934283, now seen corresponding path program 83 times [2018-12-03 19:26:43,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:26:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:43,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:26:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:26:43,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:26:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:26:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:46,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:46,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:26:46,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:26:46,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 19:26:46,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:26:46,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 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 19:26:46,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:26:46,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:26:46,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 19:26:46,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:26:46,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:26:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:51,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:26:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:26:54,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:26:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 19:26:54,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:26:54,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 19:26:54,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 19:26:54,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5849, Invalid=24253, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 19:26:54,115 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 174 states. [2018-12-03 19:27:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:00,047 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 19:27:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 19:27:00,047 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 131 [2018-12-03 19:27:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:00,048 INFO L225 Difference]: With dead ends: 222 [2018-12-03 19:27:00,048 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 19:27:00,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 90 SyntacticMatches, 85 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25286 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=8816, Invalid=38056, Unknown=0, NotChecked=0, Total=46872 [2018-12-03 19:27:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 19:27:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 19:27:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 19:27:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 19:27:00,088 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-12-03 19:27:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:00,088 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 19:27:00,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 19:27:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 19:27:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 19:27:00,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:00,089 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-12-03 19:27:00,089 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:00,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1201796172, now seen corresponding path program 84 times [2018-12-03 19:27:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:00,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:00,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:00,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:00,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:00,992 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:00,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:00,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:00,992 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 19:27:01,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:27:01,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:27:01,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:27:01,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:27:01,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:01,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:02,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:02,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 48 [2018-12-03 19:27:02,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 19:27:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 19:27:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 19:27:02,586 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 49 states. [2018-12-03 19:27:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:03,650 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 19:27:03,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 19:27:03,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 132 [2018-12-03 19:27:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:03,651 INFO L225 Difference]: With dead ends: 141 [2018-12-03 19:27:03,652 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 19:27:03,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 218 SyntacticMatches, 86 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 19:27:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 19:27:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 19:27:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 19:27:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 19:27:03,692 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 19:27:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:03,693 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 19:27:03,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 19:27:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 19:27:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 19:27:03,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:03,694 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-12-03 19:27:03,694 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:03,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 420133646, now seen corresponding path program 85 times [2018-12-03 19:27:03,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:03,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:03,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:06,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:06,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:06,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:06,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:06,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:06,437 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 19:27:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:06,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:27:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:06,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:11,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:14,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:14,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 19:27:14,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:14,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 19:27:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 19:27:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6117, Invalid=25389, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 19:27:14,397 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 178 states. [2018-12-03 19:27:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:18,780 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 19:27:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 19:27:18,780 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 134 [2018-12-03 19:27:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:18,781 INFO L225 Difference]: With dead ends: 227 [2018-12-03 19:27:18,781 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 19:27:18,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 92 SyntacticMatches, 87 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26490 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=9219, Invalid=39843, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:27:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 19:27:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 19:27:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 19:27:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 19:27:18,825 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 19:27:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:18,825 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 19:27:18,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 19:27:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 19:27:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 19:27:18,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:18,826 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-12-03 19:27:18,826 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:18,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash 711010565, now seen corresponding path program 86 times [2018-12-03 19:27:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:18,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:20,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:20,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:20,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:20,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:20,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:20,066 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 19:27:20,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:27:20,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:27:20,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 19:27:20,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:27:20,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:20,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:21,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 49 [2018-12-03 19:27:21,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:21,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 19:27:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 19:27:21,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:27:21,769 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 50 states. [2018-12-03 19:27:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:22,947 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-12-03 19:27:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 19:27:22,948 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 135 [2018-12-03 19:27:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:22,948 INFO L225 Difference]: With dead ends: 144 [2018-12-03 19:27:22,949 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 19:27:22,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 223 SyntacticMatches, 88 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 19:27:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 19:27:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-12-03 19:27:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 19:27:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 19:27:22,994 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-12-03 19:27:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:22,994 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 19:27:22,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 19:27:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 19:27:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 19:27:22,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:22,995 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-12-03 19:27:22,995 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:22,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash 381405215, now seen corresponding path program 87 times [2018-12-03 19:27:22,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:22,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:22,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:25,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:25,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:25,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:25,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 19:27:25,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:25,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 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 19:27:25,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:27:25,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:27:26,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:27:26,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:27:26,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:31,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 19:27:34,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:34,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 19:27:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 19:27:34,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6391, Invalid=26551, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:27:34,068 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 182 states. [2018-12-03 19:27:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:38,178 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-12-03 19:27:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 19:27:38,178 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 137 [2018-12-03 19:27:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:38,179 INFO L225 Difference]: With dead ends: 232 [2018-12-03 19:27:38,179 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 19:27:38,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 94 SyntacticMatches, 89 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=9631, Invalid=41671, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 19:27:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 19:27:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 19:27:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 19:27:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 19:27:38,232 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-12-03 19:27:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:38,233 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 19:27:38,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 19:27:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 19:27:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 19:27:38,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:38,234 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-12-03 19:27:38,234 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:38,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1348304184, now seen corresponding path program 88 times [2018-12-03 19:27:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:38,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:38,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:39,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:39,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:39,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:39,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 19:27:39,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:39,246 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 19:27:39,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:39,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:27:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:39,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:39,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:41,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 50 [2018-12-03 19:27:41,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:41,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:27:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:27:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 19:27:41,233 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 51 states. [2018-12-03 19:27:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:42,378 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 19:27:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 19:27:42,379 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 138 [2018-12-03 19:27:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:42,379 INFO L225 Difference]: With dead ends: 147 [2018-12-03 19:27:42,380 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 19:27:42,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 228 SyntacticMatches, 90 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 19:27:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 19:27:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-03 19:27:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 19:27:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 19:27:42,428 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 19:27:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:42,428 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 19:27:42,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 19:27:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 19:27:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 19:27:42,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:42,429 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-12-03 19:27:42,429 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:42,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1359854882, now seen corresponding path program 89 times [2018-12-03 19:27:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:42,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:42,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:45,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:45,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:27:45,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:45,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:45,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:45,252 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 19:27:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:27:45,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:27:45,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 19:27:45,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:27:45,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:27:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:51,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:27:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:27:54,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:27:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 19:27:54,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:27:54,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 19:27:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 19:27:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6671, Invalid=27739, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 19:27:54,059 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 186 states. [2018-12-03 19:27:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:58,903 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 19:27:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 19:27:58,903 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 140 [2018-12-03 19:27:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:58,904 INFO L225 Difference]: With dead ends: 237 [2018-12-03 19:27:58,904 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 19:27:58,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 96 SyntacticMatches, 91 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28982 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=10052, Invalid=43540, Unknown=0, NotChecked=0, Total=53592 [2018-12-03 19:27:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 19:27:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 19:27:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 19:27:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 19:27:58,946 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 19:27:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:58,947 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 19:27:58,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 19:27:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 19:27:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 19:27:58,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:58,947 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-12-03 19:27:58,947 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1690200615, now seen corresponding path program 90 times [2018-12-03 19:27:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:58,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:58,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:00,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:00,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:00,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:00,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:00,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:00,000 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 19:28:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:28:00,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:28:00,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:28:00,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:28:00,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:00,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 51 [2018-12-03 19:28:02,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:02,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 19:28:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 19:28:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:28:02,161 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 52 states. [2018-12-03 19:28:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:03,374 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-12-03 19:28:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 19:28:03,374 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 141 [2018-12-03 19:28:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:03,375 INFO L225 Difference]: With dead ends: 150 [2018-12-03 19:28:03,375 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 19:28:03,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 233 SyntacticMatches, 92 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3628, Invalid=6074, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 19:28:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 19:28:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-03 19:28:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 19:28:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 19:28:03,423 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-03 19:28:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:03,423 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 19:28:03,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 19:28:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 19:28:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 19:28:03,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:03,424 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-12-03 19:28:03,424 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:03,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash -785100813, now seen corresponding path program 91 times [2018-12-03 19:28:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:03,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:28:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:03,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:06,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:06,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:06,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:06,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 19:28:06,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:06,643 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 19:28:06,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:28:06,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:28:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:06,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:12,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:15,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 19:28:15,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:15,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 19:28:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 19:28:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6957, Invalid=28953, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:28:15,625 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 190 states. [2018-12-03 19:28:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:22,496 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 19:28:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 19:28:22,497 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 143 [2018-12-03 19:28:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:22,497 INFO L225 Difference]: With dead ends: 242 [2018-12-03 19:28:22,497 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 19:28:22,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 98 SyntacticMatches, 93 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30270 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=10482, Invalid=45450, Unknown=0, NotChecked=0, Total=55932 [2018-12-03 19:28:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 19:28:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 19:28:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 19:28:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 19:28:22,546 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-12-03 19:28:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:22,546 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 19:28:22,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 19:28:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 19:28:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 19:28:22,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:22,547 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-12-03 19:28:22,547 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:22,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -660297764, now seen corresponding path program 92 times [2018-12-03 19:28:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:28:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:22,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:23,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:23,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:23,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:23,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:23,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:23,611 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 19:28:23,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:28:23,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:28:23,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 19:28:23,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:28:23,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:23,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:25,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:25,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 52 [2018-12-03 19:28:25,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:25,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 19:28:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 19:28:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 19:28:25,548 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 53 states. [2018-12-03 19:28:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:27,047 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 19:28:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 19:28:27,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 144 [2018-12-03 19:28:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:27,048 INFO L225 Difference]: With dead ends: 153 [2018-12-03 19:28:27,049 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 19:28:27,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 94 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3777, Invalid=6323, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 19:28:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 19:28:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-03 19:28:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 19:28:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 19:28:27,097 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 19:28:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:27,097 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 19:28:27,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 19:28:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 19:28:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 19:28:27,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:27,098 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-12-03 19:28:27,098 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1109060918, now seen corresponding path program 93 times [2018-12-03 19:28:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:27,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:28:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:27,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:30,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:30,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:30,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:30,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:30,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:30,063 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 19:28:30,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:28:30,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:28:30,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:28:30,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:28:30,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:36,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 19:28:39,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:39,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 19:28:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 19:28:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7249, Invalid=30193, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:28:39,612 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 194 states. [2018-12-03 19:28:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:45,511 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 19:28:45,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 19:28:45,511 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 146 [2018-12-03 19:28:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:45,512 INFO L225 Difference]: With dead ends: 247 [2018-12-03 19:28:45,512 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 19:28:45,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 100 SyntacticMatches, 95 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31586 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=10921, Invalid=47401, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 19:28:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 19:28:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 19:28:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 19:28:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 19:28:45,562 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 19:28:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:45,562 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 19:28:45,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 19:28:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 19:28:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 19:28:45,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:45,563 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-12-03 19:28:45,563 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:45,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -324984659, now seen corresponding path program 94 times [2018-12-03 19:28:45,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:45,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:28:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:45,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:46,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:46,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:46,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:46,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:46,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:46,709 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 19:28:46,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:28:46,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:28:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:46,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:28:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:46,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:28:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:48,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:28:48,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 53 [2018-12-03 19:28:48,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:28:48,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 19:28:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 19:28:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:28:48,735 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 54 states. [2018-12-03 19:28:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:28:50,036 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-12-03 19:28:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 19:28:50,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2018-12-03 19:28:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:28:50,037 INFO L225 Difference]: With dead ends: 156 [2018-12-03 19:28:50,037 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 19:28:50,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 243 SyntacticMatches, 96 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3929, Invalid=6577, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 19:28:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 19:28:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 19:28:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 19:28:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 19:28:50,090 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-12-03 19:28:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:28:50,090 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 19:28:50,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 19:28:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 19:28:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 19:28:50,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:28:50,091 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-12-03 19:28:50,091 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:28:50,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:28:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1222407623, now seen corresponding path program 95 times [2018-12-03 19:28:50,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:28:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:50,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:28:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:28:50,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:28:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:28:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:28:53,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:53,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:28:53,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:28:53,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:28:53,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:28:53,534 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 19:28:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:28:53,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:28:53,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 19:28:53,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:28:53,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:00,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:03,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 19:29:03,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 19:29:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 19:29:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7547, Invalid=31459, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 19:29:03,715 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 198 states. [2018-12-03 19:29:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:29:09,942 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 19:29:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 19:29:09,943 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 149 [2018-12-03 19:29:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:29:09,943 INFO L225 Difference]: With dead ends: 252 [2018-12-03 19:29:09,943 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 19:29:09,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 102 SyntacticMatches, 97 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32930 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=11369, Invalid=49393, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 19:29:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 19:29:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 19:29:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 19:29:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 19:29:10,003 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-12-03 19:29:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:29:10,003 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 19:29:10,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 19:29:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 19:29:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 19:29:10,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:29:10,004 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-12-03 19:29:10,005 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:29:10,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:29:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1610316528, now seen corresponding path program 96 times [2018-12-03 19:29:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:29:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:10,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:29:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:10,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:29:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:11,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:11,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:29:11,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:29:11,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:29:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:11,131 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 19:29:11,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:29:11,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:29:11,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:29:11,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:29:11,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:11,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 54 [2018-12-03 19:29:13,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 19:29:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 19:29:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 19:29:13,430 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 55 states. [2018-12-03 19:29:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:29:14,765 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 19:29:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 19:29:14,766 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 150 [2018-12-03 19:29:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:29:14,767 INFO L225 Difference]: With dead ends: 159 [2018-12-03 19:29:14,767 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 19:29:14,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 248 SyntacticMatches, 98 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4084, Invalid=6836, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 19:29:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 19:29:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-12-03 19:29:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 19:29:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 19:29:14,820 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 19:29:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:29:14,820 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 19:29:14,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 19:29:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 19:29:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 19:29:14,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:29:14,821 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-12-03 19:29:14,821 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:29:14,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:29:14,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1326009162, now seen corresponding path program 97 times [2018-12-03 19:29:14,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:29:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:14,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:29:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:14,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:29:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:18,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:18,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:29:18,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:29:18,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:29:18,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:18,406 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 19:29:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:29:18,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:29:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:18,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:25,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 19:29:28,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:28,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-03 19:29:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-03 19:29:28,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7851, Invalid=32751, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:29:28,716 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 202 states. [2018-12-03 19:29:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:29:36,366 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 19:29:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 19:29:36,366 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 152 [2018-12-03 19:29:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:29:36,367 INFO L225 Difference]: With dead ends: 257 [2018-12-03 19:29:36,367 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 19:29:36,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 104 SyntacticMatches, 99 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=11826, Invalid=51426, Unknown=0, NotChecked=0, Total=63252 [2018-12-03 19:29:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 19:29:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 19:29:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 19:29:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 19:29:36,416 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 19:29:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:29:36,417 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 19:29:36,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-03 19:29:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 19:29:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 19:29:36,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:29:36,417 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-12-03 19:29:36,417 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:29:36,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:29:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -236795519, now seen corresponding path program 98 times [2018-12-03 19:29:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:29:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:29:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:36,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:29:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:37,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:37,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:29:37,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:29:37,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:29:37,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:37,655 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 19:29:37,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:29:37,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:29:37,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 19:29:37,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:29:37,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:38,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:40,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:40,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 55 [2018-12-03 19:29:40,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:40,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 19:29:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 19:29:40,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:29:40,074 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 56 states. [2018-12-03 19:29:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:29:41,478 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-12-03 19:29:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 19:29:41,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 153 [2018-12-03 19:29:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:29:41,479 INFO L225 Difference]: With dead ends: 162 [2018-12-03 19:29:41,479 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 19:29:41,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 253 SyntacticMatches, 100 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4242, Invalid=7100, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 19:29:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 19:29:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-03 19:29:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 19:29:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 19:29:41,529 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-12-03 19:29:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:29:41,530 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 19:29:41,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 19:29:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 19:29:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 19:29:41,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:29:41,531 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-12-03 19:29:41,531 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:29:41,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:29:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash 72825243, now seen corresponding path program 99 times [2018-12-03 19:29:41,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:29:41,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:41,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:29:41,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:29:41,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:29:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:29:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:45,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:45,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:29:45,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:29:45,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 19:29:45,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:29:45,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 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 19:29:45,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:29:45,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:29:45,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:29:45,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:29:45,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:29:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:52,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:29:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:29:56,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:29:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 19:29:56,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:29:56,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-12-03 19:29:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-12-03 19:29:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8161, Invalid=34069, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:29:56,100 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 206 states. [2018-12-03 19:30:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:00,942 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-12-03 19:30:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 19:30:00,942 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 155 [2018-12-03 19:30:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:00,942 INFO L225 Difference]: With dead ends: 262 [2018-12-03 19:30:00,943 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 19:30:00,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 106 SyntacticMatches, 101 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35702 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=12292, Invalid=53500, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 19:30:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 19:30:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 19:30:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 19:30:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 19:30:00,997 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-12-03 19:30:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:00,997 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 19:30:00,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-12-03 19:30:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 19:30:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 19:30:00,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:00,998 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-12-03 19:30:00,998 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:00,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash 4062212, now seen corresponding path program 100 times [2018-12-03 19:30:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:00,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:01,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:30:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:01,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:02,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:02,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:02,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:02,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 19:30:02,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:02,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 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 19:30:02,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:30:02,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:30:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:02,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:02,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2018-12-03 19:30:04,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 19:30:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 19:30:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 19:30:04,695 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 57 states. [2018-12-03 19:30:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:06,151 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 19:30:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 19:30:06,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 156 [2018-12-03 19:30:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:06,152 INFO L225 Difference]: With dead ends: 165 [2018-12-03 19:30:06,152 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 19:30:06,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 258 SyntacticMatches, 102 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4403, Invalid=7369, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 19:30:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 19:30:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-12-03 19:30:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 19:30:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 19:30:06,210 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 19:30:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:06,211 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 19:30:06,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 19:30:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 19:30:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 19:30:06,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:06,212 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-12-03 19:30:06,212 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:06,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash -391129250, now seen corresponding path program 101 times [2018-12-03 19:30:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:06,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:30:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:06,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:09,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:09,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:09,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:30:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:09,995 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 19:30:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:30:10,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:30:10,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 19:30:10,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:30:10,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:17,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:21,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 19:30:21,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:21,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-12-03 19:30:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-12-03 19:30:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8477, Invalid=35413, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 19:30:21,369 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 210 states. [2018-12-03 19:30:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:26,771 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-12-03 19:30:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 19:30:26,772 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 158 [2018-12-03 19:30:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:26,773 INFO L225 Difference]: With dead ends: 267 [2018-12-03 19:30:26,773 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 19:30:26,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 108 SyntacticMatches, 103 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37130 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=12767, Invalid=55615, Unknown=0, NotChecked=0, Total=68382 [2018-12-03 19:30:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 19:30:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 19:30:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 19:30:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 19:30:26,833 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 19:30:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:26,833 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 19:30:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-12-03 19:30:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 19:30:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 19:30:26,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:26,834 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-12-03 19:30:26,834 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:26,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash -211185579, now seen corresponding path program 102 times [2018-12-03 19:30:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:26,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:30:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:26,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:28,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:28,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:28,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:28,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 19:30:28,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:28,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 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 19:30:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:30:28,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:30:28,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:30:28,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:30:28,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:28,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:30,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 57 [2018-12-03 19:30:30,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:30,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 19:30:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 19:30:30,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=1761, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:30:30,668 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 58 states. [2018-12-03 19:30:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:32,127 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-12-03 19:30:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 19:30:32,128 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-12-03 19:30:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:32,128 INFO L225 Difference]: With dead ends: 168 [2018-12-03 19:30:32,129 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 19:30:32,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 263 SyntacticMatches, 104 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4567, Invalid=7643, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 19:30:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 19:30:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-12-03 19:30:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 19:30:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 19:30:32,194 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-12-03 19:30:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:32,194 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 19:30:32,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 19:30:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 19:30:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 19:30:32,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:32,195 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-12-03 19:30:32,196 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:32,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1085826193, now seen corresponding path program 103 times [2018-12-03 19:30:32,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:32,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:32,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:30:32,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:32,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:36,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:36,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:36,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:36,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:30:36,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:36,182 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 19:30:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:30:36,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:30:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:36,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:43,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:47,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:47,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 19:30:47,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:47,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-12-03 19:30:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-12-03 19:30:47,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8799, Invalid=36783, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 19:30:47,751 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 214 states. [2018-12-03 19:30:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:53,012 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-12-03 19:30:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 19:30:53,012 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 161 [2018-12-03 19:30:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:53,012 INFO L225 Difference]: With dead ends: 272 [2018-12-03 19:30:53,012 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 19:30:53,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 110 SyntacticMatches, 105 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38586 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=13251, Invalid=57771, Unknown=0, NotChecked=0, Total=71022 [2018-12-03 19:30:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 19:30:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 19:30:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 19:30:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 19:30:53,075 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-12-03 19:30:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:53,075 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 19:30:53,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-12-03 19:30:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 19:30:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 19:30:53,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:53,076 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-12-03 19:30:53,077 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:53,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash -503108840, now seen corresponding path program 104 times [2018-12-03 19:30:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:53,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:30:53,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:53,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:30:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:54,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:54,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:30:54,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:30:54,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:30:54,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:30:54,425 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 19:30:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:30:54,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:30:54,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 19:30:54,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:30:54,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:30:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:54,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:30:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:30:57,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:30:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 58 [2018-12-03 19:30:57,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:30:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 19:30:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 19:30:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 19:30:57,083 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 59 states. [2018-12-03 19:30:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:30:58,606 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-12-03 19:30:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 19:30:58,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 162 [2018-12-03 19:30:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:30:58,607 INFO L225 Difference]: With dead ends: 171 [2018-12-03 19:30:58,607 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 19:30:58,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 106 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4734, Invalid=7922, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 19:30:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 19:30:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 19:30:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 19:30:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 19:30:58,670 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 19:30:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:30:58,671 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 19:30:58,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 19:30:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 19:30:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 19:30:58,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:30:58,671 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-12-03 19:30:58,671 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:30:58,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:30:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1843761522, now seen corresponding path program 105 times [2018-12-03 19:30:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:30:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:58,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:30:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:30:58,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:30:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:02,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:02,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:31:02,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:31:02,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:31:02,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:02,825 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 19:31:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:31:02,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:31:02,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:31:02,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:31:02,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:31:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:11,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:31:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:14,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:31:14,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 19:31:14,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:31:14,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-12-03 19:31:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-12-03 19:31:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=38179, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:31:14,670 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 218 states. [2018-12-03 19:31:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:31:23,415 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-12-03 19:31:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 19:31:23,415 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 164 [2018-12-03 19:31:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:31:23,415 INFO L225 Difference]: With dead ends: 277 [2018-12-03 19:31:23,415 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 19:31:23,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 112 SyntacticMatches, 107 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40070 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=13744, Invalid=59968, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 19:31:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 19:31:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 19:31:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 19:31:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-03 19:31:23,487 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-12-03 19:31:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:31:23,487 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-03 19:31:23,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-12-03 19:31:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-03 19:31:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 19:31:23,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:31:23,488 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-12-03 19:31:23,488 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:31:23,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:31:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1318614313, now seen corresponding path program 106 times [2018-12-03 19:31:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:31:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:23,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:31:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:23,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:31:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:24,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:24,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:31:24,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:31:24,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:31:24,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:24,895 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 19:31:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:31:24,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:31:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:25,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:31:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:25,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:31:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:27,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:31:27,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 59 [2018-12-03 19:31:27,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:31:27,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 19:31:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 19:31:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=1882, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 19:31:27,554 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 60 states. [2018-12-03 19:31:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:31:29,109 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-12-03 19:31:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 19:31:29,109 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 165 [2018-12-03 19:31:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:31:29,110 INFO L225 Difference]: With dead ends: 174 [2018-12-03 19:31:29,110 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 19:31:29,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 273 SyntacticMatches, 108 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4904, Invalid=8206, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 19:31:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 19:31:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-12-03 19:31:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 19:31:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-03 19:31:29,174 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-03 19:31:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:31:29,175 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-03 19:31:29,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 19:31:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-03 19:31:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 19:31:29,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:31:29,175 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-12-03 19:31:29,175 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:31:29,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:31:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash 173054787, now seen corresponding path program 107 times [2018-12-03 19:31:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:31:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:29,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:31:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:29,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:31:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:33,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:33,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:31:33,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:31:33,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:31:33,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:33,384 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 19:31:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:31:33,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:31:33,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 19:31:33,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:31:33,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:31:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:42,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:31:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:45,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:31:45,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 19:31:45,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:31:45,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-12-03 19:31:45,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-12-03 19:31:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9461, Invalid=39601, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:31:45,925 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 222 states. [2018-12-03 19:31:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:31:53,489 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-12-03 19:31:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 19:31:53,490 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 167 [2018-12-03 19:31:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:31:53,490 INFO L225 Difference]: With dead ends: 282 [2018-12-03 19:31:53,490 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 19:31:53,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 114 SyntacticMatches, 109 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41582 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=14246, Invalid=62206, Unknown=0, NotChecked=0, Total=76452 [2018-12-03 19:31:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 19:31:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 19:31:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 19:31:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 19:31:53,561 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-12-03 19:31:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:31:53,561 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 19:31:53,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-12-03 19:31:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 19:31:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 19:31:53,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:31:53,562 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-12-03 19:31:53,562 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:31:53,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:31:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2078410796, now seen corresponding path program 108 times [2018-12-03 19:31:53,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:31:53,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:53,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:31:53,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:53,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:31:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:31:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:54,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:54,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:31:54,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:31:54,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:31:54,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:31:54,961 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 19:31:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:31:54,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:31:55,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:31:55,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:31:55,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:31:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:55,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:31:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:31:57,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:31:57,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 60 [2018-12-03 19:31:57,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:31:57,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 19:31:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 19:31:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 19:31:57,710 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 61 states. [2018-12-03 19:31:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:31:59,401 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-12-03 19:31:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 19:31:59,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 168 [2018-12-03 19:31:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:31:59,402 INFO L225 Difference]: With dead ends: 177 [2018-12-03 19:31:59,402 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 19:31:59,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 278 SyntacticMatches, 110 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5077, Invalid=8495, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 19:31:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 19:31:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 19:31:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 19:31:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 19:31:59,474 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 19:31:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:31:59,475 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 19:31:59,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 19:31:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 19:31:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 19:31:59,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:31:59,475 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-12-03 19:31:59,476 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:31:59,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:31:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 193034630, now seen corresponding path program 109 times [2018-12-03 19:31:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:31:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:59,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:31:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:31:59,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:31:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:32:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:03,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:03,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:32:03,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:32:03,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:32:03,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:03,933 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 19:32:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:32:03,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:32:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:32:04,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:32:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:12,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:32:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:16,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:32:16,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 19:32:16,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:32:16,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-12-03 19:32:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-12-03 19:32:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9801, Invalid=41049, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 19:32:16,878 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 226 states. [2018-12-03 19:32:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:32:24,676 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-12-03 19:32:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 19:32:24,676 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 170 [2018-12-03 19:32:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:32:24,677 INFO L225 Difference]: With dead ends: 287 [2018-12-03 19:32:24,677 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 19:32:24,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 116 SyntacticMatches, 111 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43122 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=14757, Invalid=64485, Unknown=0, NotChecked=0, Total=79242 [2018-12-03 19:32:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 19:32:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 19:32:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 19:32:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-12-03 19:32:24,741 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-12-03 19:32:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:32:24,741 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-12-03 19:32:24,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-12-03 19:32:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-12-03 19:32:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 19:32:24,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:32:24,742 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-12-03 19:32:24,742 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:32:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:32:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 366114813, now seen corresponding path program 110 times [2018-12-03 19:32:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:32:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:32:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:24,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:32:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:32:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:26,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:26,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:32:26,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:32:26,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:32:26,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:26,185 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 19:32:26,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:32:26,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:32:26,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 19:32:26,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:32:26,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:32:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:26,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:32:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:29,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:32:29,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 61 [2018-12-03 19:32:29,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:32:29,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 19:32:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 19:32:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=2007, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:32:29,225 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 62 states. [2018-12-03 19:32:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:32:30,930 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-12-03 19:32:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 19:32:30,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 171 [2018-12-03 19:32:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:32:30,931 INFO L225 Difference]: With dead ends: 180 [2018-12-03 19:32:30,931 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 19:32:30,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 283 SyntacticMatches, 112 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5253, Invalid=8789, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 19:32:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 19:32:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-12-03 19:32:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 19:32:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-03 19:32:31,000 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-12-03 19:32:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:32:31,001 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-03 19:32:31,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 19:32:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-03 19:32:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 19:32:31,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:32:31,001 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-12-03 19:32:31,001 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:32:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:32:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash -350930665, now seen corresponding path program 111 times [2018-12-03 19:32:31,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:32:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:31,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:32:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:31,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:32:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:32:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:35,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:35,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:32:35,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:32:35,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:32:35,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:32:35,519 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 19:32:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:32:35,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:32:35,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:32:35,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:32:35,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:32:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:44,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:32:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:32:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:32:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 229 [2018-12-03 19:32:49,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:32:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-12-03 19:32:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-12-03 19:32:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10147, Invalid=42523, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 19:32:49,078 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 230 states. [2018-12-03 19:32:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:32:58,824 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 19:32:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 19:32:58,824 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 173 [2018-12-03 19:32:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:32:58,825 INFO L225 Difference]: With dead ends: 292 [2018-12-03 19:32:58,825 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 19:32:58,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 118 SyntacticMatches, 113 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44690 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=15277, Invalid=66805, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 19:32:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 19:32:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 19:32:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 19:32:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 19:32:58,895 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-12-03 19:32:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:32:58,896 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 19:32:58,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-12-03 19:32:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 19:32:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 19:32:58,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:32:58,896 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-12-03 19:32:58,896 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:32:58,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:32:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1920045888, now seen corresponding path program 112 times [2018-12-03 19:32:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:32:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:58,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:32:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:32:58,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:32:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:00,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:00,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:33:00,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:33:00,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:33:00,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:00,430 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 19:33:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:33:00,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:33:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:00,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:33:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:00,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:03,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:03,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 62 [2018-12-03 19:33:03,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:03,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 19:33:03,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 19:33:03,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 19:33:03,383 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-12-03 19:33:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:33:05,036 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-12-03 19:33:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 19:33:05,036 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 174 [2018-12-03 19:33:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:33:05,037 INFO L225 Difference]: With dead ends: 183 [2018-12-03 19:33:05,037 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 19:33:05,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 288 SyntacticMatches, 114 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5432, Invalid=9088, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 19:33:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 19:33:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-12-03 19:33:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 19:33:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 19:33:05,109 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 19:33:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:33:05,109 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 19:33:05,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 19:33:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 19:33:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 19:33:05,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:33:05,109 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-12-03 19:33:05,110 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:33:05,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:33:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1671786598, now seen corresponding path program 113 times [2018-12-03 19:33:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:33:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:05,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:33:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:05,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:33:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:09,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:33:09,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:33:09,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:33:09,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:09,697 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 19:33:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:33:09,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:33:10,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 19:33:10,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:33:10,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:33:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:19,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:23,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:23,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 233 [2018-12-03 19:33:23,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:23,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-12-03 19:33:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-12-03 19:33:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10499, Invalid=44023, Unknown=0, NotChecked=0, Total=54522 [2018-12-03 19:33:23,584 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 234 states. [2018-12-03 19:33:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:33:28,765 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-12-03 19:33:28,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 19:33:28,765 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 176 [2018-12-03 19:33:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:33:28,766 INFO L225 Difference]: With dead ends: 297 [2018-12-03 19:33:28,766 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 19:33:28,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 120 SyntacticMatches, 115 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46286 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=15806, Invalid=69166, Unknown=0, NotChecked=0, Total=84972 [2018-12-03 19:33:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 19:33:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 19:33:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 19:33:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-12-03 19:33:28,842 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-12-03 19:33:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:33:28,842 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-12-03 19:33:28,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-12-03 19:33:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-12-03 19:33:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 19:33:28,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:33:28,843 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-12-03 19:33:28,843 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:33:28,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:33:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1334142767, now seen corresponding path program 114 times [2018-12-03 19:33:28,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:33:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:28,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:33:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:28,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:33:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:30,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:30,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:33:30,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:33:30,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 19:33:30,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:30,395 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:33:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:33:30,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:33:30,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:33:30,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:33:30,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:33:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:30,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:33,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:33,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 63 [2018-12-03 19:33:33,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:33,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 19:33:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 19:33:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:33:33,153 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 64 states. [2018-12-03 19:33:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:33:35,120 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-12-03 19:33:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 19:33:35,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 177 [2018-12-03 19:33:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:33:35,121 INFO L225 Difference]: With dead ends: 186 [2018-12-03 19:33:35,121 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 19:33:35,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 293 SyntacticMatches, 116 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5614, Invalid=9392, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 19:33:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 19:33:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 19:33:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 19:33:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-12-03 19:33:35,194 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-12-03 19:33:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:33:35,194 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-12-03 19:33:35,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 19:33:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-12-03 19:33:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 19:33:35,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:33:35,195 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-12-03 19:33:35,195 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:33:35,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:33:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2084074731, now seen corresponding path program 115 times [2018-12-03 19:33:35,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:33:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:35,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:33:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:33:35,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:33:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:39,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:39,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:33:39,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:33:39,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:33:39,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:33:39,962 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:33:39,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:33:39,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:33:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:33:40,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:33:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:49,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:33:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:33:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:33:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 237 [2018-12-03 19:33:53,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:33:53,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-12-03 19:33:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-12-03 19:33:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10857, Invalid=45549, Unknown=0, NotChecked=0, Total=56406 [2018-12-03 19:33:53,842 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 238 states. [2018-12-03 19:34:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:00,759 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-12-03 19:34:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 19:34:00,760 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 179 [2018-12-03 19:34:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:00,760 INFO L225 Difference]: With dead ends: 302 [2018-12-03 19:34:00,760 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 19:34:00,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 122 SyntacticMatches, 117 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47910 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=16344, Invalid=71568, Unknown=0, NotChecked=0, Total=87912 [2018-12-03 19:34:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 19:34:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 19:34:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 19:34:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 19:34:00,840 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-12-03 19:34:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:00,840 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 19:34:00,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-12-03 19:34:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 19:34:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 19:34:00,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:00,841 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-12-03 19:34:00,841 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:00,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2018036820, now seen corresponding path program 116 times [2018-12-03 19:34:00,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:00,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:02,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:02,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:02,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:02,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:02,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:02,383 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:02,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:02,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 19:34:02,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:02,748 INFO L273 TraceCheckSpWp]: Computing forward predicates...