java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:52:01,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:52:01,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:52:01,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:52:01,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:52:01,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:52:01,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:52:01,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:52:01,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:52:01,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:52:01,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:52:01,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:52:01,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:52:01,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:52:01,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:52:01,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:52:01,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:52:01,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:52:01,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:52:01,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:52:01,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:52:01,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:52:01,107 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:52:01,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:52:01,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:52:01,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:52:01,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:52:01,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:52:01,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:52:01,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:52:01,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:52:01,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:52:01,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:52:01,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:52:01,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:52:01,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:52:01,118 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 13:52:01,131 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:52:01,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:52:01,132 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:52:01,132 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:52:01,132 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:52:01,132 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:52:01,132 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:52:01,133 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:52:01,133 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:52:01,133 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:52:01,133 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:52:01,133 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:52:01,134 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:52:01,134 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:52:01,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:52:01,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:52:01,135 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:52:01,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:52:01,135 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:52:01,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:52:01,136 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:52:01,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:52:01,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:52:01,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:52:01,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:52:01,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:52:01,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:52:01,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:52:01,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:52:01,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:52:01,138 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:52:01,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:52:01,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:52:01,139 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:52:01,139 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:52:01,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:52:01,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:52:01,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:52:01,217 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:52:01,218 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:52:01,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-08 13:52:01,219 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-08 13:52:01,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:52:01,260 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:52:01,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:01,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:52:01,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:52:01,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:01,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:52:01,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:52:01,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:52:01,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/1) ... [2019-01-08 13:52:01,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:52:01,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:52:01,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:52:01,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:52:01,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 13:52:01,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-08 13:52:01,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:52:01,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:52:01,708 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:52:01,708 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-08 13:52:01,710 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:01 BoogieIcfgContainer [2019-01-08 13:52:01,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:52:01,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:52:01,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:52:01,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:52:01,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:01" (1/2) ... [2019-01-08 13:52:01,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e49e02d and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:52:01, skipping insertion in model container [2019-01-08 13:52:01,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:01" (2/2) ... [2019-01-08 13:52:01,720 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-08 13:52:01,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:52:01,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:52:01,753 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:52:01,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:52:01,789 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:52:01,789 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:52:01,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:52:01,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:52:01,790 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:52:01,790 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:52:01,790 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:52:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-08 13:52:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:52:01,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:01,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 13:52:01,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-08 13:52:01,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:02,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:02,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:52:02,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:02,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:52:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:52:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:52:02,104 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-08 13:52:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,290 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-08 13:52:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:52:02,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 13:52:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,304 INFO L225 Difference]: With dead ends: 26 [2019-01-08 13:52:02,304 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 13:52:02,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 13:52:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 13:52:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-08 13:52:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 13:52:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-08 13:52:02,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-08 13:52:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,340 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-08 13:52:02,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:52:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-08 13:52:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:52:02,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:02,341 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-08 13:52:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:02,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:02,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-08 13:52:02,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:02,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:52:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:52:02,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:52:02,452 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-08 13:52:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,578 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-08 13:52:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:52:02,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-08 13:52:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,580 INFO L225 Difference]: With dead ends: 25 [2019-01-08 13:52:02,580 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 13:52:02,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 13:52:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 13:52:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-08 13:52:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 13:52:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-08 13:52:02,587 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-08 13:52:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,588 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-08 13:52:02,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:52:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-08 13:52:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:52:02,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:02,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-08 13:52:02,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 13:52:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:52:02,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:02,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:52:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:52:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:02,655 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-08 13:52:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,695 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-08 13:52:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:52:02,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-08 13:52:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,696 INFO L225 Difference]: With dead ends: 24 [2019-01-08 13:52:02,697 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 13:52:02,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 13:52:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-08 13:52:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 13:52:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-08 13:52:02,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-08 13:52:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,701 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-08 13:52:02,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:52:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-08 13:52:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:52:02,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:02,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-08 13:52:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:02,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:03,028 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-08 13:52:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:03,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 13:52:03,076 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-08 13:52:03,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:52:03,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:52:03,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:52:03,342 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 13:52:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:03,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:52:03,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:03,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:03,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:03,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-08 13:52:03,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:03,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 13:52:03,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 13:52:03,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-08 13:52:03,682 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-08 13:52:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:03,930 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-08 13:52:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:52:03,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-08 13:52:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:03,935 INFO L225 Difference]: With dead ends: 26 [2019-01-08 13:52:03,935 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 13:52:03,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-08 13:52:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 13:52:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-08 13:52:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 13:52:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-08 13:52:03,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-08 13:52:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:03,942 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-08 13:52:03,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 13:52:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-08 13:52:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-08 13:52:03,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:03,943 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:03,944 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-08 13:52:03,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:03,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:03,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:04,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-08 13:52:04,026 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-08 13:52:04,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:52:04,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:52:04,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:52:04,095 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-01-08 13:52:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:52:04,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:04,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:04,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:04,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-08 13:52:04,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:04,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:52:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:52:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:52:04,279 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-08 13:52:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:04,698 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-08 13:52:04,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:52:04,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-08 13:52:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:04,700 INFO L225 Difference]: With dead ends: 31 [2019-01-08 13:52:04,700 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 13:52:04,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:52:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 13:52:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-08 13:52:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 13:52:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-08 13:52:04,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-08 13:52:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-08 13:52:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:52:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-08 13:52:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 13:52:04,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:04,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:04,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-08 13:52:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:05,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:05,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:05,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:05,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:05,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 13:52:05,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:05,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:05,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-08 13:52:05,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:05,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 13:52:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 13:52:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-08 13:52:05,255 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-08 13:52:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,564 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-08 13:52:05,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:52:05,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-08 13:52:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,566 INFO L225 Difference]: With dead ends: 35 [2019-01-08 13:52:05,566 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 13:52:05,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-08 13:52:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 13:52:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-08 13:52:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 13:52:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-08 13:52:05,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-08 13:52:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,573 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-08 13:52:05,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 13:52:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-08 13:52:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 13:52:05,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,574 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-08 13:52:05,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-08 13:52:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:05,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:05,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:05,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:05,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:05,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:05,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:05,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-08 13:52:05,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:05,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 13:52:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 13:52:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-08 13:52:05,844 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-08 13:52:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,971 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-08 13:52:05,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:52:05,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-08 13:52:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,973 INFO L225 Difference]: With dead ends: 45 [2019-01-08 13:52:05,973 INFO L226 Difference]: Without dead ends: 26 [2019-01-08 13:52:05,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-08 13:52:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-08 13:52:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 13:52:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-08 13:52:05,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-08 13:52:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-08 13:52:05,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 13:52:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-08 13:52:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-08 13:52:05,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,981 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-08 13:52:05,981 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-08 13:52:05,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:06,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:06,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:06,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:06,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:06,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-08 13:52:06,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:52:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:52:06,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:06,597 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-08 13:52:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:06,974 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-08 13:52:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:52:06,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-08 13:52:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:06,983 INFO L225 Difference]: With dead ends: 49 [2019-01-08 13:52:06,983 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 13:52:06,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:52:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 13:52:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-08 13:52:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 13:52:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-08 13:52:06,989 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-08 13:52:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:06,989 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-08 13:52:06,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:52:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-08 13:52:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-08 13:52:06,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,990 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-08 13:52:06,990 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-08 13:52:06,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:07,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:07,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:07,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:07,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:07,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 13:52:07,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:07,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:07,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-08 13:52:07,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:07,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:52:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:52:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:07,287 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-08 13:52:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:07,562 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-08 13:52:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:52:07,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-08 13:52:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:07,564 INFO L225 Difference]: With dead ends: 60 [2019-01-08 13:52:07,564 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 13:52:07,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:52:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 13:52:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-08 13:52:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 13:52:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-08 13:52:07,570 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-08 13:52:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:07,570 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-08 13:52:07,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:52:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-08 13:52:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 13:52:07,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:07,573 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-08 13:52:07,573 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-08 13:52:07,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:07,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:07,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:07,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:07,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:07,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:07,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:07,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:07,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:07,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:07,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-08 13:52:08,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:08,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 13:52:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 13:52:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:08,046 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-08 13:52:08,908 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-08 13:52:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,450 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-08 13:52:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:09,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-08 13:52:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,454 INFO L225 Difference]: With dead ends: 64 [2019-01-08 13:52:09,454 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 13:52:09,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-08 13:52:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 13:52:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-08 13:52:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 13:52:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-08 13:52:09,461 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-08 13:52:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,461 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-08 13:52:09,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 13:52:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-08 13:52:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 13:52:09,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,463 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-08 13:52:09,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-08 13:52:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:09,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:09,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:09,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:09,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:09,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:09,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:10,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-08 13:52:10,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:10,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 13:52:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 13:52:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:10,327 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-08 13:52:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,694 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-08 13:52:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:52:10,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-08 13:52:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,696 INFO L225 Difference]: With dead ends: 75 [2019-01-08 13:52:10,696 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 13:52:10,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:52:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 13:52:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-08 13:52:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 13:52:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-08 13:52:10,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-08 13:52:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,704 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-08 13:52:10,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 13:52:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-08 13:52:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-08 13:52:10,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,705 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-08 13:52:10,706 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-08 13:52:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:10,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:10,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:10,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:10,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:10,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:10,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-08 13:52:10,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:10,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:12,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-08 13:52:12,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:12,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 13:52:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 13:52:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:12,299 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-08 13:52:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:14,595 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-08 13:52:14,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:52:14,596 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-08 13:52:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:14,596 INFO L225 Difference]: With dead ends: 97 [2019-01-08 13:52:14,597 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 13:52:14,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 13:52:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-08 13:52:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 13:52:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-08 13:52:14,606 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-08 13:52:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:14,607 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-08 13:52:14,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 13:52:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-08 13:52:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 13:52:14,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:14,608 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-08 13:52:14,608 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-08 13:52:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:14,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:15,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:15,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:15,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:15,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:15,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:15,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:15,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:15,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:15,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-08 13:52:15,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:15,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 13:52:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 13:52:15,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-08 13:52:15,364 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-08 13:52:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:16,796 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-08 13:52:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:16,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-08 13:52:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:16,798 INFO L225 Difference]: With dead ends: 94 [2019-01-08 13:52:16,798 INFO L226 Difference]: Without dead ends: 72 [2019-01-08 13:52:16,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-08 13:52:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-08 13:52:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-08 13:52:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 13:52:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-08 13:52:16,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-08 13:52:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-08 13:52:16,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 13:52:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-08 13:52:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 13:52:16,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:16,809 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-08 13:52:16,810 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:16,810 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-08 13:52:16,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:17,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:17,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:17,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:17,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:17,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-08 13:52:17,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:17,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 13:52:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 13:52:17,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-08 13:52:17,365 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-08 13:52:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:17,638 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-08 13:52:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:52:17,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-08 13:52:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:17,640 INFO L225 Difference]: With dead ends: 105 [2019-01-08 13:52:17,640 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 13:52:17,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:52:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 13:52:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-08 13:52:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 13:52:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-08 13:52:17,649 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-08 13:52:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:17,650 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-08 13:52:17,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 13:52:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-08 13:52:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 13:52:17,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:17,651 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-08 13:52:17,651 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-08 13:52:17,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:17,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:17,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:17,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:17,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:17,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:18,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 13:52:18,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:18,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-08 13:52:18,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:18,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:52:18,329 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-08 13:52:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:19,733 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-08 13:52:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:52:19,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-08 13:52:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:19,741 INFO L225 Difference]: With dead ends: 109 [2019-01-08 13:52:19,741 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 13:52:19,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 13:52:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-08 13:52:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-08 13:52:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-08 13:52:19,756 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-08 13:52:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:19,756 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-08 13:52:19,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-08 13:52:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-08 13:52:19,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:19,758 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-08 13:52:19,758 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-08 13:52:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:20,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:20,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:20,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:20,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:20,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:20,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:20,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:20,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:20,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-08 13:52:20,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:20,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:52:20,459 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-08 13:52:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:20,845 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-08 13:52:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:52:20,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-08 13:52:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:20,847 INFO L225 Difference]: With dead ends: 120 [2019-01-08 13:52:20,847 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 13:52:20,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 13:52:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-08 13:52:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 13:52:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-08 13:52:20,857 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-08 13:52:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:20,857 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-08 13:52:20,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-08 13:52:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 13:52:20,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:20,858 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-08 13:52:20,859 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-08 13:52:20,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:21,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:21,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:21,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:21,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:21,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:21,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:21,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:21,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-08 13:52:21,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:21,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 13:52:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 13:52:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:21,695 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-08 13:52:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:23,153 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-08 13:52:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:52:23,153 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-08 13:52:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:23,155 INFO L225 Difference]: With dead ends: 124 [2019-01-08 13:52:23,155 INFO L226 Difference]: Without dead ends: 94 [2019-01-08 13:52:23,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-08 13:52:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-08 13:52:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-08 13:52:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 13:52:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-08 13:52:23,167 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-08 13:52:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:23,167 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-08 13:52:23,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 13:52:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-08 13:52:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 13:52:23,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:23,168 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-08 13:52:23,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-08 13:52:23,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:23,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:23,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:23,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:23,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:23,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:23,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:23,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:23,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:23,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-08 13:52:23,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:23,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-08 13:52:24,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:24,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 13:52:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 13:52:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:24,088 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-08 13:52:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:24,627 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-08 13:52:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:24,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-08 13:52:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:24,629 INFO L225 Difference]: With dead ends: 135 [2019-01-08 13:52:24,629 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 13:52:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 13:52:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-08 13:52:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 13:52:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-08 13:52:24,647 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-08 13:52:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:24,647 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-08 13:52:24,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 13:52:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-08 13:52:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-08 13:52:24,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:24,648 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-08 13:52:24,654 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-08 13:52:24,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:24,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:24,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:25,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:25,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:25,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:25,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:25,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:25,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:25,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:25,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:25,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-08 13:52:25,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:25,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:25,557 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-08 13:52:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:27,438 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-08 13:52:27,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:52:27,438 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-08 13:52:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:27,439 INFO L225 Difference]: With dead ends: 139 [2019-01-08 13:52:27,439 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 13:52:27,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 13:52:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-08 13:52:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-08 13:52:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-08 13:52:27,450 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-08 13:52:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:27,450 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-08 13:52:27,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-08 13:52:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-08 13:52:27,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:27,451 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-08 13:52:27,451 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:27,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-08 13:52:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:27,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:27,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:27,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:27,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:27,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-08 13:52:28,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:28,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:28,804 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-08 13:52:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:29,380 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-08 13:52:29,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:29,380 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-08 13:52:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:29,381 INFO L225 Difference]: With dead ends: 150 [2019-01-08 13:52:29,381 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 13:52:29,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 13:52:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-08 13:52:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 13:52:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-08 13:52:29,392 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-08 13:52:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:29,392 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-08 13:52:29,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-08 13:52:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 13:52:29,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:29,392 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-08 13:52:29,393 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-08 13:52:29,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:30,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:30,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:30,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:30,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:30,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:30,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:30,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 13:52:30,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:30,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:31,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-08 13:52:31,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:31,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:52:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:52:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:52:31,981 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-08 13:52:34,705 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-08 13:52:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:36,654 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-08 13:52:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:52:36,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-08 13:52:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:36,656 INFO L225 Difference]: With dead ends: 192 [2019-01-08 13:52:36,656 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 13:52:36,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 13:52:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 13:52:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-08 13:52:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-08 13:52:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-08 13:52:36,671 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-08 13:52:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:36,672 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-08 13:52:36,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:52:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-08 13:52:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-08 13:52:36,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:36,672 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-08 13:52:36,672 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-08 13:52:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:36,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:36,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:37,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:37,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:37,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:37,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:37,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:37,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:37,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:37,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:38,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-08 13:52:38,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:38,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:38,554 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-08 13:52:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:40,982 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-08 13:52:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:52:40,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-08 13:52:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:40,985 INFO L225 Difference]: With dead ends: 169 [2019-01-08 13:52:40,985 INFO L226 Difference]: Without dead ends: 127 [2019-01-08 13:52:40,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-08 13:52:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-08 13:52:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 13:52:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-08 13:52:40,995 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-08 13:52:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:40,995 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-08 13:52:40,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-08 13:52:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-08 13:52:40,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:40,996 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-08 13:52:40,997 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-08 13:52:40,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:40,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:41,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:41,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:41,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:41,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:41,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:41,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:41,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-08 13:52:41,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:41,840 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-08 13:52:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:42,378 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-08 13:52:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:42,379 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-08 13:52:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:42,380 INFO L225 Difference]: With dead ends: 180 [2019-01-08 13:52:42,380 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 13:52:42,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 13:52:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-08 13:52:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 13:52:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-08 13:52:42,392 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-08 13:52:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:42,393 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-08 13:52:42,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-08 13:52:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 13:52:42,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:42,394 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-08 13:52:42,394 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-08 13:52:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:42,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:42,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:42,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:42,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:42,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:42,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 13:52:42,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:42,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:44,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:45,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-08 13:52:45,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:45,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 13:52:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 13:52:45,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-08 13:52:45,387 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-08 13:52:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:51,664 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-08 13:52:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 13:52:51,664 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-08 13:52:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:51,665 INFO L225 Difference]: With dead ends: 230 [2019-01-08 13:52:51,665 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 13:52:51,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-08 13:52:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 13:52:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-08 13:52:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-08 13:52:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-08 13:52:51,685 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-08 13:52:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:51,685 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-08 13:52:51,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 13:52:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-08 13:52:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-08 13:52:51,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:51,686 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-08 13:52:51,686 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-08 13:52:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:52,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:52,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:52,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:52,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:52,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:52,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:52,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:52,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:52,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:52,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-08 13:52:53,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:53,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:53,174 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-08 13:52:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:56,481 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-08 13:52:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:52:56,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-08 13:52:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:56,483 INFO L225 Difference]: With dead ends: 199 [2019-01-08 13:52:56,483 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 13:52:56,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 13:52:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-08 13:52:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 13:52:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-08 13:52:56,500 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-08 13:52:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-08 13:52:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-08 13:52:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-08 13:52:56,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:56,501 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-08 13:52:56,501 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-08 13:52:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:56,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:56,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:56,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:56,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:56,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:56,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:56,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:56,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:56,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:56,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:57,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:58,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:58,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-08 13:52:58,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:58,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:58,061 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-08 13:52:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:58,713 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-08 13:52:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:58,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-08 13:52:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:58,714 INFO L225 Difference]: With dead ends: 210 [2019-01-08 13:52:58,714 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 13:52:58,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 13:52:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-08 13:52:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 13:52:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-08 13:52:58,732 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-08 13:52:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:58,732 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-08 13:52:58,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-08 13:52:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 13:52:58,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:58,733 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-08 13:52:58,734 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-08 13:52:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:58,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:58,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:59,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:59,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:59,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:59,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:59,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:59,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:52:59,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:59,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:59,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-08 13:52:59,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:59,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:00,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:00,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:00,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-08 13:53:00,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:00,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:53:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:53:00,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 13:53:00,556 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-08 13:53:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:04,003 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-08 13:53:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:53:04,003 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-08 13:53:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:04,004 INFO L225 Difference]: With dead ends: 214 [2019-01-08 13:53:04,004 INFO L226 Difference]: Without dead ends: 160 [2019-01-08 13:53:04,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-08 13:53:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-08 13:53:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-08 13:53:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 13:53:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-08 13:53:04,022 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-08 13:53:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:04,022 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-08 13:53:04,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:53:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-08 13:53:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 13:53:04,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:04,023 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-08 13:53:04,023 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-08 13:53:04,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:04,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:04,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:04,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:04,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:04,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:04,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:04,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:04,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:04,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:04,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:04,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:05,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-08 13:53:05,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:05,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:53:05,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:53:05,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 13:53:05,439 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-08 13:53:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:06,090 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-08 13:53:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:53:06,090 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-08 13:53:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:06,091 INFO L225 Difference]: With dead ends: 225 [2019-01-08 13:53:06,092 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 13:53:06,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:53:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 13:53:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-08 13:53:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-08 13:53:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-08 13:53:06,111 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-08 13:53:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:06,111 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-08 13:53:06,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:53:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-08 13:53:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-08 13:53:06,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:06,112 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-08 13:53:06,112 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:06,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-08 13:53:06,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:06,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:06,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:06,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:06,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:07,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:07,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:07,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:07,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:07,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:07,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:07,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:07,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:07,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:07,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:08,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:08,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-08 13:53:08,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:08,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:53:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:53:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:53:08,036 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-08 13:53:12,834 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-08 13:53:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:13,146 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-08 13:53:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:53:13,147 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-08 13:53:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:13,147 INFO L225 Difference]: With dead ends: 229 [2019-01-08 13:53:13,148 INFO L226 Difference]: Without dead ends: 171 [2019-01-08 13:53:13,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:53:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-08 13:53:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-08 13:53:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 13:53:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-08 13:53:13,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-08 13:53:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-08 13:53:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:53:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-08 13:53:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 13:53:13,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:13,172 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-08 13:53:13,172 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-08 13:53:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:13,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:13,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:13,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:13,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:13,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:13,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:13,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:13,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 13:53:13,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:13,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:14,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:14,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:14,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-08 13:53:14,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:14,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:53:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:53:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:53:14,437 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-08 13:53:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:15,199 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-08 13:53:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:53:15,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-08 13:53:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:15,200 INFO L225 Difference]: With dead ends: 240 [2019-01-08 13:53:15,200 INFO L226 Difference]: Without dead ends: 117 [2019-01-08 13:53:15,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:53:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-08 13:53:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-08 13:53:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-08 13:53:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-08 13:53:15,218 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-08 13:53:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:15,219 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-08 13:53:15,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:53:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-08 13:53:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-08 13:53:15,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:15,220 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-08 13:53:15,220 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-08 13:53:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:15,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:15,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:16,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:16,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:16,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:16,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:16,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:16,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:16,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:16,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:16,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:16,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:16,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:17,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-08 13:53:17,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 13:53:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 13:53:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:53:17,198 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-08 13:53:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:22,463 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-08 13:53:22,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:53:22,469 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-08 13:53:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:22,470 INFO L225 Difference]: With dead ends: 244 [2019-01-08 13:53:22,470 INFO L226 Difference]: Without dead ends: 182 [2019-01-08 13:53:22,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-08 13:53:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-08 13:53:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-08 13:53:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-08 13:53:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-08 13:53:22,495 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-08 13:53:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:22,495 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-08 13:53:22,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 13:53:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-08 13:53:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-08 13:53:22,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:22,496 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-08 13:53:22,496 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-08 13:53:22,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:23,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:23,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:23,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:23,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:23,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:24,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-08 13:53:24,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:24,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 13:53:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 13:53:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:53:24,127 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-08 13:53:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:25,049 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-08 13:53:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:53:25,050 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-08 13:53:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:25,051 INFO L225 Difference]: With dead ends: 255 [2019-01-08 13:53:25,051 INFO L226 Difference]: Without dead ends: 124 [2019-01-08 13:53:25,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:53:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-08 13:53:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-08 13:53:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-08 13:53:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-08 13:53:25,070 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-08 13:53:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:25,070 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-08 13:53:25,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 13:53:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-08 13:53:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-08 13:53:25,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:25,071 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-08 13:53:25,071 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-08 13:53:25,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:25,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:25,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:25,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:26,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:26,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:26,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:26,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:26,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:26,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:26,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:26,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:26,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-08 13:53:26,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:26,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:28,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:30,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:30,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-08 13:53:30,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:30,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 13:53:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 13:53:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:30,002 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-08 13:53:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:40,467 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-08 13:53:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-08 13:53:40,468 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-08 13:53:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:40,469 INFO L225 Difference]: With dead ends: 325 [2019-01-08 13:53:40,469 INFO L226 Difference]: Without dead ends: 190 [2019-01-08 13:53:40,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 13:53:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-08 13:53:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-08 13:53:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-08 13:53:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-08 13:53:40,492 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-08 13:53:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:40,492 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-08 13:53:40,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 13:53:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-08 13:53:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-08 13:53:40,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:40,493 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-08 13:53:40,493 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-08 13:53:40,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:40,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:40,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:40,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:40,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:41,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:41,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:41,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:41,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:41,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:41,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:41,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:41,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:41,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:42,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-08 13:53:42,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:42,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 13:53:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 13:53:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:53:42,776 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-08 13:53:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:48,498 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-08 13:53:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 13:53:48,499 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-08 13:53:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:48,501 INFO L225 Difference]: With dead ends: 274 [2019-01-08 13:53:48,501 INFO L226 Difference]: Without dead ends: 204 [2019-01-08 13:53:48,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:53:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-08 13:53:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-08 13:53:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 13:53:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-08 13:53:48,527 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-08 13:53:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:48,528 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-08 13:53:48,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 13:53:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-08 13:53:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-08 13:53:48,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:48,529 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-08 13:53:48,529 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-08 13:53:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:48,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:48,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:49,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:49,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:49,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:49,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:49,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:49,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:49,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:49,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:49,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:49,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-08 13:53:50,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 13:53:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 13:53:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:53:50,402 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-08 13:53:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:51,532 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-08 13:53:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:53:51,532 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-08 13:53:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:51,534 INFO L225 Difference]: With dead ends: 285 [2019-01-08 13:53:51,534 INFO L226 Difference]: Without dead ends: 138 [2019-01-08 13:53:51,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:53:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-08 13:53:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-08 13:53:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-08 13:53:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-08 13:53:51,557 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-08 13:53:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:51,557 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-08 13:53:51,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 13:53:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-08 13:53:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-08 13:53:51,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:51,558 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-08 13:53:51,559 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-08 13:53:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:51,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:52,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:52,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:52,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:52,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:52,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:52,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:53:52,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:52,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:52,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 13:53:52,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:52,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:57,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-08 13:53:57,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:57,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 13:53:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 13:53:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:57,857 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-08 13:54:08,795 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 13:54:09,089 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 13:54:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:11,781 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-08 13:54:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-08 13:54:11,781 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-08 13:54:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:11,783 INFO L225 Difference]: With dead ends: 363 [2019-01-08 13:54:11,783 INFO L226 Difference]: Without dead ends: 212 [2019-01-08 13:54:11,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 13:54:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-08 13:54:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-08 13:54:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-08 13:54:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-08 13:54:11,810 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-08 13:54:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:11,811 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-08 13:54:11,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 13:54:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-08 13:54:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-08 13:54:11,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:11,812 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-08 13:54:11,812 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-08 13:54:11,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:11,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:11,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:14,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:14,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:14,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:14,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:14,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:14,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:14,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:14,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:14,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:14,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:14,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:16,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:16,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-08 13:54:16,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:16,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 13:54:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 13:54:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:54:16,783 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-08 13:54:21,042 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 13:54:21,337 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 13:54:21,661 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 13:54:21,861 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 13:54:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:23,580 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-08 13:54:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 13:54:23,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-08 13:54:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:23,581 INFO L225 Difference]: With dead ends: 304 [2019-01-08 13:54:23,581 INFO L226 Difference]: Without dead ends: 226 [2019-01-08 13:54:23,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-08 13:54:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-08 13:54:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-08 13:54:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 13:54:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-08 13:54:23,608 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-08 13:54:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:23,609 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-08 13:54:23,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 13:54:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-08 13:54:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-08 13:54:23,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:23,610 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-08 13:54:23,610 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-08 13:54:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:23,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:23,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:24,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:24,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:24,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:24,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:24,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:24,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:24,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:24,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:25,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-08 13:54:25,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:25,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 13:54:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 13:54:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:54:25,783 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-08 13:54:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:27,369 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-08 13:54:27,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:54:27,369 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-08 13:54:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:27,370 INFO L225 Difference]: With dead ends: 315 [2019-01-08 13:54:27,370 INFO L226 Difference]: Without dead ends: 152 [2019-01-08 13:54:27,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:54:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-08 13:54:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-08 13:54:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-08 13:54:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-08 13:54:27,408 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-08 13:54:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:27,409 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-08 13:54:27,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 13:54:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-08 13:54:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-08 13:54:27,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:27,410 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-08 13:54:27,410 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-08 13:54:27,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:27,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:27,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:29,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:29,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:29,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:29,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:29,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:29,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:29,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:29,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 13:54:29,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:29,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:32,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:35,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:35,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-08 13:54:35,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:35,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 13:54:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 13:54:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:54:35,416 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-08 13:54:47,708 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 13:54:48,017 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 13:54:48,335 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 13:54:48,609 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:54:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:51,336 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-08 13:54:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-08 13:54:51,336 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-08 13:54:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:51,338 INFO L225 Difference]: With dead ends: 401 [2019-01-08 13:54:51,338 INFO L226 Difference]: Without dead ends: 234 [2019-01-08 13:54:51,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-08 13:54:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-08 13:54:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-08 13:54:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 13:54:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-08 13:54:51,374 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-08 13:54:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:51,375 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-08 13:54:51,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 13:54:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-08 13:54:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 13:54:51,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:51,376 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-08 13:54:51,376 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-08 13:54:51,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:51,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:51,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:51,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:53,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:53,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:53,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:53,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:53,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:53,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:53,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:53,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:53,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:54,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:55,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:55,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-08 13:54:55,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:55,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 13:54:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 13:54:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 13:54:55,106 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-08 13:55:01,055 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 13:55:01,371 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 13:55:01,675 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 13:55:01,874 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:55:02,072 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:55:02,262 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 13:55:02,513 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 13:55:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:04,237 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-08 13:55:04,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 13:55:04,238 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-08 13:55:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:04,239 INFO L225 Difference]: With dead ends: 334 [2019-01-08 13:55:04,240 INFO L226 Difference]: Without dead ends: 248 [2019-01-08 13:55:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-08 13:55:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-08 13:55:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-08 13:55:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-08 13:55:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-08 13:55:04,293 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-08 13:55:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:04,293 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-08 13:55:04,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 13:55:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-08 13:55:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-08 13:55:04,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:04,294 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-08 13:55:04,294 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-08 13:55:04,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:04,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:04,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:05,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:05,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:05,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:05,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:05,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:05,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:05,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:05,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:05,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:06,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:06,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:06,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-08 13:55:06,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:06,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 13:55:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 13:55:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 13:55:06,783 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-08 13:55:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:08,648 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-08 13:55:08,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:55:08,651 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-08 13:55:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:08,652 INFO L225 Difference]: With dead ends: 345 [2019-01-08 13:55:08,652 INFO L226 Difference]: Without dead ends: 166 [2019-01-08 13:55:08,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:55:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-08 13:55:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-08 13:55:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-08 13:55:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-08 13:55:08,684 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-08 13:55:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:08,684 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-08 13:55:08,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 13:55:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-08 13:55:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-08 13:55:08,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:08,685 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-08 13:55:08,685 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-08 13:55:08,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:08,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:08,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:10,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:10,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:10,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:10,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:10,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:10,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:10,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:10,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-08 13:55:10,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:10,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:11,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:11,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:11,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-08 13:55:11,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:11,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:55:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:55:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:55:11,817 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-08 13:55:19,153 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 13:55:19,497 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 13:55:19,817 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 13:55:20,032 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:55:20,246 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:55:20,443 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:55:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:22,543 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-08 13:55:22,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 13:55:22,544 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-08 13:55:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:22,546 INFO L225 Difference]: With dead ends: 349 [2019-01-08 13:55:22,546 INFO L226 Difference]: Without dead ends: 259 [2019-01-08 13:55:22,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:55:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-08 13:55:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-08 13:55:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-08 13:55:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-08 13:55:22,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-08 13:55:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:22,582 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-08 13:55:22,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:55:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-08 13:55:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-08 13:55:22,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:22,583 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-08 13:55:22,583 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-08 13:55:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:22,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:22,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:23,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:23,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:23,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:23,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:23,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:23,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:23,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:23,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:23,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:24,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:25,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:25,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-08 13:55:25,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:25,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:55:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:55:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:55:25,581 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-08 13:55:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:27,421 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-08 13:55:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:55:27,421 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-08 13:55:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:27,422 INFO L225 Difference]: With dead ends: 360 [2019-01-08 13:55:27,423 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 13:55:27,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:55:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 13:55:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-08 13:55:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-08 13:55:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-08 13:55:27,469 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-08 13:55:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:27,469 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-08 13:55:27,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:55:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-08 13:55:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-08 13:55:27,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:27,470 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-08 13:55:27,470 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-08 13:55:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:27,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:27,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:29,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:29,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:29,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:29,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:29,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:29,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:29,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:29,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:31,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:31,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:31,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-08 13:55:31,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:31,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 13:55:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 13:55:31,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:55:31,399 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-08 13:55:39,134 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 13:55:39,489 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 13:55:39,838 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 13:55:40,079 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:55:40,313 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:55:40,522 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:55:40,728 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:55:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:42,918 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-08 13:55:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-08 13:55:42,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-08 13:55:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:42,920 INFO L225 Difference]: With dead ends: 364 [2019-01-08 13:55:42,920 INFO L226 Difference]: Without dead ends: 270 [2019-01-08 13:55:42,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 13:55:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-08 13:55:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-08 13:55:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-08 13:55:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-08 13:55:42,958 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-08 13:55:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:42,958 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-08 13:55:42,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 13:55:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-08 13:55:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-08 13:55:42,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:42,959 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-08 13:55:42,959 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-08 13:55:42,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:42,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:42,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:44,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:44,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:44,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:44,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:44,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:44,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:44,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:44,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:44,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 13:55:44,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:44,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:45,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:46,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-08 13:55:46,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:46,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 13:55:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 13:55:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:55:46,721 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-08 13:55:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:48,816 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-08 13:55:48,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:55:48,816 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-08 13:55:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:48,817 INFO L225 Difference]: With dead ends: 375 [2019-01-08 13:55:48,817 INFO L226 Difference]: Without dead ends: 180 [2019-01-08 13:55:48,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:55:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-08 13:55:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-08 13:55:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-08 13:55:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-08 13:55:48,861 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-08 13:55:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:48,861 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-08 13:55:48,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 13:55:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-08 13:55:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-08 13:55:48,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:48,862 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-08 13:55:48,862 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-08 13:55:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:48,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:48,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:51,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:51,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:51,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:51,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:51,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:51,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:55:51,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:51,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:51,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:51,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:51,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:52,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:53,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:53,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-08 13:55:53,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:53,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:55:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:55:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:55:53,082 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-08 13:55:59,773 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 13:56:00,142 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 13:56:00,508 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 13:56:00,755 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:56:00,991 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:56:01,221 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:56:01,431 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:56:01,639 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:56:01,876 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 13:56:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:03,998 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-08 13:56:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-08 13:56:03,998 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-08 13:56:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:04,000 INFO L225 Difference]: With dead ends: 379 [2019-01-08 13:56:04,000 INFO L226 Difference]: Without dead ends: 281 [2019-01-08 13:56:04,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:56:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-08 13:56:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-08 13:56:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-08 13:56:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-08 13:56:04,053 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-08 13:56:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:04,053 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-08 13:56:04,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:56:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-08 13:56:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-08 13:56:04,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:04,054 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-08 13:56:04,054 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-08 13:56:04,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:04,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:04,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:05,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:05,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:05,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:05,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:05,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:05,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:05,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:05,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:06,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:07,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:07,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-08 13:56:07,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:56:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:56:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:56:07,055 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-08 13:56:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:09,143 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-08 13:56:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:56:09,143 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-08 13:56:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:09,144 INFO L225 Difference]: With dead ends: 390 [2019-01-08 13:56:09,144 INFO L226 Difference]: Without dead ends: 187 [2019-01-08 13:56:09,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:56:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-08 13:56:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-08 13:56:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-08 13:56:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-08 13:56:09,203 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-08 13:56:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:09,203 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-08 13:56:09,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:56:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-08 13:56:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-08 13:56:09,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:09,204 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-08 13:56:09,205 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-08 13:56:09,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:09,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:09,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:11,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:11,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:11,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:11,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:11,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:11,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:11,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:11,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:11,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-08 13:56:11,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:11,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:16,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:20,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:20,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-08 13:56:20,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:20,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-08 13:56:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-08 13:56:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-08 13:56:20,368 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-08 13:56:38,459 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 13:56:38,905 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 13:56:39,387 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 13:56:39,822 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:56:40,233 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:56:40,598 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:56:40,941 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:56:41,268 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:56:41,592 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:56:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:44,737 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-08 13:56:44,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-08 13:56:44,738 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-08 13:56:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:44,740 INFO L225 Difference]: With dead ends: 496 [2019-01-08 13:56:44,740 INFO L226 Difference]: Without dead ends: 289 [2019-01-08 13:56:44,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-08 13:56:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-08 13:56:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-08 13:56:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-08 13:56:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-08 13:56:44,788 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-08 13:56:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:44,788 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-08 13:56:44,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-08 13:56:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-08 13:56:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-08 13:56:44,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:44,789 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-08 13:56:44,789 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-08 13:56:44,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:44,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:44,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:46,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:46,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:46,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:46,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:46,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:46,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:56:46,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:46,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:46,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:46,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:46,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:48,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:49,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:49,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-08 13:56:49,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:56:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:56:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:56:49,196 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-08 13:56:57,959 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 13:56:58,368 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 13:56:58,764 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 13:56:59,038 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:56:59,297 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:56:59,553 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:56:59,802 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:57:00,047 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:57:00,332 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:57:00,565 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:57:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:02,940 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-08 13:57:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-08 13:57:02,941 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-08 13:57:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:02,942 INFO L225 Difference]: With dead ends: 409 [2019-01-08 13:57:02,942 INFO L226 Difference]: Without dead ends: 303 [2019-01-08 13:57:02,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:57:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-08 13:57:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-08 13:57:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-08 13:57:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-08 13:57:02,987 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-08 13:57:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-08 13:57:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:57:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-08 13:57:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-08 13:57:02,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:02,988 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-08 13:57:02,988 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-08 13:57:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:02,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:02,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:04,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:04,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:04,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:04,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:04,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:04,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:04,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:04,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:04,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:05,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-08 13:57:06,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:57:06,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:57:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:57:06,888 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-08 13:57:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:09,236 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-08 13:57:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:57:09,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-08 13:57:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:09,240 INFO L225 Difference]: With dead ends: 420 [2019-01-08 13:57:09,240 INFO L226 Difference]: Without dead ends: 201 [2019-01-08 13:57:09,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:57:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-08 13:57:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-08 13:57:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 13:57:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-08 13:57:09,284 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-08 13:57:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:09,285 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-08 13:57:09,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:57:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-08 13:57:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-08 13:57:09,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:09,286 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-08 13:57:09,286 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:09,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:09,286 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-08 13:57:09,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:11,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:11,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:11,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:11,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:11,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:11,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:11,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:11,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:11,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 13:57:11,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:11,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:13,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:13,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-08 13:57:13,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:13,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 13:57:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 13:57:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:57:13,686 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-08 13:57:22,575 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 13:57:23,006 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 13:57:23,421 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 13:57:23,728 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 13:57:24,015 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:57:24,293 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:57:24,563 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:57:24,817 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:57:25,066 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:57:25,305 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:57:25,536 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:57:25,766 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 13:57:26,078 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 13:57:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:28,098 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-08 13:57:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-08 13:57:28,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-08 13:57:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:28,101 INFO L225 Difference]: With dead ends: 424 [2019-01-08 13:57:28,101 INFO L226 Difference]: Without dead ends: 314 [2019-01-08 13:57:28,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-08 13:57:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-08 13:57:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-08 13:57:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-08 13:57:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-08 13:57:28,159 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-08 13:57:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:28,159 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-08 13:57:28,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 13:57:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-08 13:57:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-08 13:57:28,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:28,161 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-08 13:57:28,161 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-08 13:57:28,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:28,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:28,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:28,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:28,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:29,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:29,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:29,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:29,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:29,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:29,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:29,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:29,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:29,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:29,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:29,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:30,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:31,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-08 13:57:31,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:31,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 13:57:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 13:57:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:57:31,998 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-08 13:57:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:34,495 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-08 13:57:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:57:34,495 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-08 13:57:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:34,496 INFO L225 Difference]: With dead ends: 435 [2019-01-08 13:57:34,496 INFO L226 Difference]: Without dead ends: 208 [2019-01-08 13:57:34,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:57:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-08 13:57:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-08 13:57:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-08 13:57:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-08 13:57:34,554 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-08 13:57:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:34,554 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-08 13:57:34,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 13:57:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-08 13:57:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-08 13:57:34,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:34,556 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-08 13:57:34,556 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-08 13:57:34,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:34,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:34,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:36,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:36,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:36,885 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:36,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:36,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:36,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:36,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:36,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:39,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:39,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:39,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-08 13:57:39,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:39,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:57:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:57:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:57:39,284 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-08 13:57:48,636 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 13:57:49,081 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 13:57:49,538 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 13:57:49,845 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 13:57:50,148 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 13:57:50,455 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:57:50,739 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:57:51,016 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:57:51,281 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:57:51,580 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:57:51,852 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:57:52,089 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:57:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:54,593 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-08 13:57:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-08 13:57:54,593 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-08 13:57:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:54,596 INFO L225 Difference]: With dead ends: 439 [2019-01-08 13:57:54,596 INFO L226 Difference]: Without dead ends: 325 [2019-01-08 13:57:54,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:57:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-08 13:57:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-08 13:57:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-08 13:57:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-08 13:57:54,662 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-08 13:57:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:54,663 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-08 13:57:54,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:57:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-08 13:57:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-08 13:57:54,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:54,664 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-08 13:57:54,664 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-08 13:57:54,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:54,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:55,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:55,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:55,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:55,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:55,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:55,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:55,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:56,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-08 13:57:56,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:56,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:57,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:59,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:59,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-08 13:57:59,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:59,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:57:59,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:57:59,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:57:59,022 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-08 13:58:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:01,794 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-08 13:58:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:58:01,795 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-08 13:58:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:01,796 INFO L225 Difference]: With dead ends: 450 [2019-01-08 13:58:01,796 INFO L226 Difference]: Without dead ends: 215 [2019-01-08 13:58:01,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:58:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-08 13:58:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-08 13:58:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-08 13:58:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-08 13:58:01,853 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-08 13:58:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:01,853 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-08 13:58:01,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:58:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-08 13:58:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-08 13:58:01,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:01,854 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-08 13:58:01,854 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-08 13:58:01,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:01,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:01,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:01,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:04,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:04,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:04,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:04,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:04,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:04,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:04,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:04,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:04,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:04,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:06,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-08 13:58:07,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:07,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 13:58:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 13:58:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:58:07,271 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-08 13:58:17,782 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 13:58:18,252 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 13:58:18,730 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 13:58:19,054 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 13:58:19,381 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 13:58:19,685 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 13:58:19,990 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:58:20,281 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:58:20,558 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:58:20,831 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:58:21,090 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:58:21,334 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:58:21,587 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:58:22,300 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-08 13:58:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:24,233 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-08 13:58:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-08 13:58:24,234 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-08 13:58:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:24,236 INFO L225 Difference]: With dead ends: 454 [2019-01-08 13:58:24,236 INFO L226 Difference]: Without dead ends: 336 [2019-01-08 13:58:24,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-08 13:58:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-08 13:58:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-08 13:58:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-08 13:58:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-08 13:58:24,325 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-08 13:58:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:24,325 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-08 13:58:24,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 13:58:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-08 13:58:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-08 13:58:24,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:24,326 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-08 13:58:24,327 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-08 13:58:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:24,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:24,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:25,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:25,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:25,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:25,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:25,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:25,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:25,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:25,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:27,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:28,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:28,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-08 13:58:28,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 13:58:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 13:58:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:58:28,819 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-08 13:58:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:31,603 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-08 13:58:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:58:31,604 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-08 13:58:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:31,605 INFO L225 Difference]: With dead ends: 465 [2019-01-08 13:58:31,606 INFO L226 Difference]: Without dead ends: 222 [2019-01-08 13:58:31,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:58:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-08 13:58:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-08 13:58:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-08 13:58:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-08 13:58:31,658 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-08 13:58:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:31,659 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-08 13:58:31,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 13:58:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-08 13:58:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-08 13:58:31,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:31,660 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-08 13:58:31,660 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-08 13:58:31,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:31,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:31,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:31,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:31,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:34,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:34,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:34,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:34,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:34,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:34,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:34,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:34,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 13:58:34,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:34,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:40,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:46,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:46,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-08 13:58:46,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:46,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-08 13:58:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-08 13:58:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:58:46,021 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-08 13:59:10,970 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 13:59:11,551 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 13:59:12,145 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 13:59:12,657 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 13:59:13,168 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 13:59:13,716 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 13:59:14,188 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 13:59:14,654 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:59:15,105 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:59:15,553 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:59:15,964 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:59:16,358 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:59:16,734 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:59:17,114 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:59:18,463 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-08 13:59:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:20,896 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-08 13:59:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-08 13:59:20,896 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-08 13:59:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:20,897 INFO L225 Difference]: With dead ends: 591 [2019-01-08 13:59:20,897 INFO L226 Difference]: Without dead ends: 344 [2019-01-08 13:59:20,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-08 13:59:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-08 13:59:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-08 13:59:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-08 13:59:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-08 13:59:20,956 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-08 13:59:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:20,956 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-08 13:59:20,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-08 13:59:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-08 13:59:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-08 13:59:20,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:20,957 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-08 13:59:20,957 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-08 13:59:20,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:23,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:23,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:23,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:23,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:23,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:23,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:23,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:23,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:26,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:26,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:26,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-08 13:59:26,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:26,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 13:59:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 13:59:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:59:26,628 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-08 13:59:40,008 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 13:59:40,536 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 13:59:41,036 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 13:59:41,390 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 13:59:41,729 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 13:59:42,062 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 13:59:42,386 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 13:59:42,699 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 13:59:43,022 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 13:59:43,334 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 13:59:43,624 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 13:59:43,903 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 13:59:44,242 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 13:59:44,514 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 13:59:44,764 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 13:59:45,242 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 13:59:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:47,529 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-08 13:59:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-08 13:59:47,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-08 13:59:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:47,532 INFO L225 Difference]: With dead ends: 484 [2019-01-08 13:59:47,532 INFO L226 Difference]: Without dead ends: 358 [2019-01-08 13:59:47,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 13:59:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-08 13:59:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-08 13:59:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-08 13:59:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-08 13:59:47,595 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-08 13:59:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:47,595 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-08 13:59:47,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 13:59:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-08 13:59:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-08 13:59:47,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:47,597 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-08 13:59:47,597 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:47,597 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-08 13:59:47,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:49,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:49,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:49,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:49,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:49,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:49,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:49,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:49,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:53,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:54,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-08 13:59:54,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:54,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 13:59:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 13:59:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:59:54,788 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-08 13:59:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:57,155 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-08 13:59:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:59:57,156 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-08 13:59:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:57,157 INFO L225 Difference]: With dead ends: 495 [2019-01-08 13:59:57,158 INFO L226 Difference]: Without dead ends: 236 [2019-01-08 13:59:57,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:59:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-08 13:59:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-08 13:59:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-08 13:59:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-08 13:59:57,235 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-08 13:59:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:57,235 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-08 13:59:57,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 13:59:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-08 13:59:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-08 13:59:57,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:57,236 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-08 13:59:57,236 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-08 13:59:57,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:57,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:00,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:00,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:00,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:00,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:00,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:00,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:00,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:00,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:00,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 14:00:00,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:00,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:07,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:13,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-08 14:00:13,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:13,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-08 14:00:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-08 14:00:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 14:00:13,709 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-08 14:00:39,865 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:00:40,528 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:00:41,167 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 14:00:41,730 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:00:42,282 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:00:42,821 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:00:43,339 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:00:43,857 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:00:44,350 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:00:44,825 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:00:45,318 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:00:45,832 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:00:46,263 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:00:46,672 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:00:47,099 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:00:47,493 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:00:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:51,587 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-08 14:00:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-08 14:00:51,588 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-08 14:00:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:51,590 INFO L225 Difference]: With dead ends: 629 [2019-01-08 14:00:51,590 INFO L226 Difference]: Without dead ends: 366 [2019-01-08 14:00:51,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-08 14:00:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-08 14:00:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-08 14:00:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-08 14:00:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-08 14:00:51,657 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-08 14:00:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:51,657 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-08 14:00:51,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-08 14:00:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-08 14:00:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-08 14:00:51,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:51,658 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-08 14:00:51,658 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-08 14:00:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:51,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:51,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:54,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:54,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:54,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:54,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:54,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:54,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:54,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:54,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:54,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:54,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:57,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:57,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-08 14:00:57,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:57,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:00:57,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:00:57,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 14:00:57,936 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-08 14:01:10,394 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:01:10,960 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:01:11,577 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:01:11,970 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:01:12,366 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:01:12,742 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:01:13,096 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:01:13,442 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:01:13,782 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:01:14,119 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:01:14,440 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:01:14,764 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:01:15,076 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:01:15,371 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:01:15,653 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:01:15,927 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:01:16,251 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:01:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:19,171 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-08 14:01:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-08 14:01:19,171 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-08 14:01:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:19,172 INFO L225 Difference]: With dead ends: 514 [2019-01-08 14:01:19,172 INFO L226 Difference]: Without dead ends: 380 [2019-01-08 14:01:19,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-08 14:01:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-08 14:01:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-08 14:01:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-08 14:01:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-08 14:01:19,239 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-08 14:01:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:19,240 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-08 14:01:19,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:01:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-08 14:01:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-08 14:01:19,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:19,241 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-08 14:01:19,241 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-08 14:01:19,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:19,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:19,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:20,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:20,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:20,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:20,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:20,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:20,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:20,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:20,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:23,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:24,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-08 14:01:24,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:24,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:01:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:01:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 14:01:24,731 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-08 14:01:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:27,581 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-08 14:01:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 14:01:27,582 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-08 14:01:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:27,583 INFO L225 Difference]: With dead ends: 525 [2019-01-08 14:01:27,583 INFO L226 Difference]: Without dead ends: 250 [2019-01-08 14:01:27,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 14:01:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-08 14:01:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-08 14:01:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-08 14:01:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-08 14:01:27,656 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-08 14:01:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:27,656 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-08 14:01:27,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:01:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-08 14:01:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-08 14:01:27,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:27,657 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-08 14:01:27,658 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-08 14:01:27,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:27,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:27,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:30,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:30,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:30,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:30,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:30,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:30,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:30,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:30,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:30,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-08 14:01:30,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:30,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:38,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:45,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:45,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-08 14:01:45,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:45,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-08 14:01:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-08 14:01:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:01:45,643 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-08 14:02:14,004 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:02:14,667 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:02:15,345 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:02:15,972 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:02:16,598 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:02:17,222 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:02:17,902 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:02:18,468 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:02:19,024 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:02:19,560 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:02:20,073 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:02:20,575 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:02:21,078 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:02:21,550 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:02:22,013 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:02:22,445 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:02:22,929 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:02:23,387 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:02:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:27,497 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-08 14:02:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-08 14:02:27,498 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-08 14:02:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:27,500 INFO L225 Difference]: With dead ends: 667 [2019-01-08 14:02:27,500 INFO L226 Difference]: Without dead ends: 388 [2019-01-08 14:02:27,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-08 14:02:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-08 14:02:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-08 14:02:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-08 14:02:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-08 14:02:27,575 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-08 14:02:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:27,575 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-08 14:02:27,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-08 14:02:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-08 14:02:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-08 14:02:27,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:27,576 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-08 14:02:27,576 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-08 14:02:27,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:27,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:27,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:27,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:30,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:30,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:30,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:30,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:30,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:30,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:30,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:30,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:30,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:30,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:34,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-08 14:02:34,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:34,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-08 14:02:34,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-08 14:02:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 14:02:34,600 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-08 14:02:49,214 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:02:49,816 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:02:50,410 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:02:50,827 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:02:51,246 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:02:51,642 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:02:52,043 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:02:52,431 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:02:52,815 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:02:53,180 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:02:53,583 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:02:53,962 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:02:54,299 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:02:54,628 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:02:54,942 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:02:55,245 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:02:55,533 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:02:55,830 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:02:56,107 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:02:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:59,286 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-08 14:02:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-08 14:02:59,287 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-08 14:02:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:59,288 INFO L225 Difference]: With dead ends: 544 [2019-01-08 14:02:59,288 INFO L226 Difference]: Without dead ends: 402 [2019-01-08 14:02:59,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 14:02:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-08 14:02:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-08 14:02:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-08 14:02:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-08 14:02:59,363 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-08 14:02:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:59,363 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-08 14:02:59,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-08 14:02:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-08 14:02:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-08 14:02:59,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:59,365 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-08 14:02:59,365 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-08 14:02:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:59,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:59,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:01,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:01,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:01,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:01,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:01,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:03,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-08 14:03:05,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:05,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-08 14:03:05,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-08 14:03:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 14:03:05,251 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-08 14:03:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:08,177 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-08 14:03:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 14:03:08,178 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-08 14:03:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:08,179 INFO L225 Difference]: With dead ends: 555 [2019-01-08 14:03:08,179 INFO L226 Difference]: Without dead ends: 264 [2019-01-08 14:03:08,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 14:03:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-08 14:03:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-08 14:03:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-08 14:03:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-08 14:03:08,253 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-08 14:03:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-08 14:03:08,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-08 14:03:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-08 14:03:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-08 14:03:08,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:08,255 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-08 14:03:08,255 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-08 14:03:08,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:08,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:08,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:11,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:11,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:11,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:11,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:11,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:11,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:11,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 14:03:11,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:11,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:28,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:28,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-08 14:03:28,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:28,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-08 14:03:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-08 14:03:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:03:28,464 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-08 14:04:00,785 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:04:01,557 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:04:02,372 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:04:03,076 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-08 14:04:03,756 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:04:04,437 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:04:05,081 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:04:05,750 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:04:06,359 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:04:06,954 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:04:07,529 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:04:08,088 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:04:08,633 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:04:09,172 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:04:09,695 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:04:10,191 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:04:10,718 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:04:11,182 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:04:11,640 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:04:12,061 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:04:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:16,517 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-08 14:04:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-08 14:04:16,518 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-08 14:04:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:16,519 INFO L225 Difference]: With dead ends: 705 [2019-01-08 14:04:16,519 INFO L226 Difference]: Without dead ends: 410 [2019-01-08 14:04:16,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-08 14:04:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-08 14:04:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-08 14:04:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-08 14:04:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-08 14:04:16,605 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-08 14:04:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:16,605 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-08 14:04:16,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-08 14:04:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-08 14:04:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-08 14:04:16,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:16,607 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-08 14:04:16,607 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-08 14:04:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:16,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:16,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:19,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:19,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:19,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:19,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:19,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:19,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:19,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:19,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:19,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:23,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:24,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-08 14:04:24,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:24,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-08 14:04:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-08 14:04:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 14:04:24,080 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-08 14:04:41,240 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-08 14:04:42,003 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-08 14:04:42,685 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:04:43,153 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-08 14:04:43,610 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-08 14:04:44,045 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:04:44,471 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:04:44,891 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:04:45,318 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:04:45,727 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:04:46,154 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:04:46,578 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:04:46,959 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:04:47,329 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:04:47,689 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:04:48,046 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:04:48,384 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:04:48,712 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:04:49,019 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:04:49,317 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:04:49,614 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:04:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:52,961 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-08 14:04:52,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-08 14:04:52,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-08 14:04:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:52,963 INFO L225 Difference]: With dead ends: 574 [2019-01-08 14:04:52,963 INFO L226 Difference]: Without dead ends: 424 [2019-01-08 14:04:52,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-08 14:04:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-08 14:04:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-08 14:04:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-08 14:04:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-08 14:04:53,059 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-08 14:04:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:53,059 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-08 14:04:53,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-08 14:04:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-08 14:04:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-08 14:04:53,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:53,060 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-08 14:04:53,061 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-08 14:04:53,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:53,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:53,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:55,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:55,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:55,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:55,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:55,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:55,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:55,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:55,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:57,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-08 14:04:59,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:59,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-08 14:04:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-08 14:04:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 14:04:59,627 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states.